Anti-Byzantine Attacks Enabled Vehicle Selection for Asynchronous Federated Learning in Vehicular Edge Computing

In vehicle edge computing(VEC),asynchronous federated learning(AFL)is used,where the edge receives a local model and updates the global model,effectively reducing the global aggregation latency.Due to different amounts of local data,computing capabilities and locations of the vehicles,renewing the global model with same weight is inappropriate.The above factors will affect the local calculation time and upload time of the local model,and the vehicle may also be affected by Byzantine attacks,leading to the deterioration of the vehicle data.However,based on deep reinforcement learning(DRL),we can consider these factors comprehensively to eliminate vehicles with poor performance as much as possible and exclude vehicles that have suffered Byzantine attacks before AFL.At the same time,when aggregating AFL,we can focus on those vehicles with better performance to improve the accuracy and safety of the system.In this paper,we proposed a vehicle selection scheme based on DRL in VEC.In this scheme,vehicle’s mobility,channel conditions with temporal variations,computational resources with temporal variations,different data amount,transmission channel status of vehicles as well as Byzantine attacks were taken into account.Simulation results show that the proposed scheme effectively improves the safety and accuracy of the global model.

Asynchronous Learning-Based Output Feedback Sliding Mode Control for Semi-Markov Jump Systems: A Descriptor Approach

This paper presents an asynchronous output-feed-back control strategy of semi-Markovian systems via sliding mode-based learning technique.Compared with most literature results that require exact prior knowledge of system state and mode information,an asynchronous output-feedback sliding sur-face is adopted in the case of incompletely available state and non-synchronization phenomenon.The holonomic dynamics of the sliding mode are characterized by a descriptor system in which the switching surface is regarded as the fast subsystem and the system dynamics are viewed as the slow subsystem.Based upon the co-occurrence of two subsystems,the sufficient stochastic admissibility criterion of the holonomic dynamics is derived by utilizing the characteristics of cumulative distribution functions.Furthermore,a recursive learning controller is formulated to guarantee the reachability of the sliding manifold and realize the chattering reduction of the asynchronous switching and sliding motion.Finally,the proposed theoretical method is substantia-ted through two numerical simulations with the practical contin-uous stirred tank reactor and F-404 aircraft engine model,respectively.

Interpolated Bumpless Transfer Control for Asynchronously Switched Linear Systems

This paper revisits the problem of bumpless transfer control(BTC) for discrete-time nondeterministic switched linear systems. The general case of asynchronous switching is considered for the first time in the field of BTC for switched systems. A new approach called interpolated bumpless transfer control(IBTC) is proposed, where the bumpless transfer controllers are formulated with the combination of the two adjacent modedependent controller gains, and are interpolated for finite steps once the switching is detected. In contrast with the existing approaches, IBTC does not necessarily run through the full interval of subsystems, as well as possesses the time-varying controller gains(with more flexibility and less conservatism) achieved from a control synthesis allowing for the stability and other performance of the whole switched system. Sufficient conditions ensuring stability and H_(∞) performance of the underlying system by IBTC are developed, and numerical examples verify the theoretical findings.

Improved model on asynchronous measurement-device-independent quantum key distribution with realistic devices

In principle,the asynchronous measurement-device-independent quantum key distribution(AMDI-QKD)can surpass the key rate capacity without phase tracking and phase locking.However,practical imperfections in sources or detections would dramatically depress its performance.Here,we present an improved model on AMDI-QKD to reduce the influence of these imperfections,including intensity fluctuation,the afterpulse effect,and the dead time of detectors.Furthermore,we carry out corresponding numerical simulations.Simulation results show that,by implementing our present work,it can have more than 100 km longer secure transmission distance and one order of magnitude enhancement in the key generation rate after 320 km compared with the standard method.Moreover,our model can still break the Pirandola–Laurenza–Ottaviani–Banchi(PLOB)bound even under realistic experimental conditions.

A Joint Activity and Data Detection Scheme for Asynchronous Grant-Free Rateless Multiple Access

This paper considers the frameasynchronous grant-free rateless multiple access(FAGF-RMA)scenario,where users can initiate access at any symbol time,using shared channel resources to transmit data to the base station.Rateless coding is introduced to enhance the reliability of the system.Previous literature has shown that FA-GFRMA can achieve lower access delay than framesynchronous grant-free rateless multiple access(FSGF-RMA),with extreme reliability enabled by rateless coding.To support FA-GF-RMA in more practical scenarios,a joint activity and data detection(JADD)scheme is proposed.Exploiting the feature of sporadic traffic,approximate message passing(AMP)is exploited for transmission signal matrix estimation.Then,to determine the packet start points,a maximum posterior probability(MAP)estimation problem is solved based on the recovered transmitted signals,leveraging the intrinsic power pattern in the codeword.An iterative power-pattern-aided AMP algorithm is devised to enhance the estimation performance of AMP.Simulation results verify that the proposed solution achieves a delay performance that is comparable to the performance limit of FA-GF-RMA.

Review on the Usage of Synchronous and Asynchronous FIFOs in Digital Systems Design

First-Input-First-Output (FIFO) buffers are extensively used in contemporary digital processors and System-on-Chips (SoC). There are synchronous FIFOs and asycnrhonous FIFOs. And different sized FIFOs should be implemented in different ways. FIFOs are used not only for the pipeline design within a processor, for the inter-processor communication networks, for example Network-on-Chips (NoCs), but also for the peripherals and the clock domain crossing at the whole SoC level. In this paper, we review the interface, the circuit implementation, and the various usages of FIFOs in various levels of the digital design. We can find that the usage of FIFOs could greatly facilitate the signal storage, signal decoupling, signal transfer, power domain separation and power domain crossing in digital systems. We hope that more attentions are paid to the usages of synchronous and asynchronous FIFOs and more sophististicated usages are discovered by the digital design communities.

An Asynchronous Implementation of Add-Compare-Select Processor for Communication Systems

A novel asynchronous ACS(add-compare-select) processor for Viterbi decoder is described.It is controlled by local handshake signals instead of the globe clock.The circuits of asynchronous adder unit,asynchronous comparator unit,and asynchronous selector unit are proposed.A full-custom design of asynchronous 4-bit ACS processor is fabricated in CSMC-HJ 0.6μm CMOS 2P2M mixed-mode process.At a supply voltage of 5V,when it operates at 20MHz,the power consumption is 75.5mW.The processor has no dynamic power consumption when it awaits an opportunity in sleep mode.The results of performance test of asynchronous 4-bit ACS processor show that the average case response time 19.18ns is only 82% of the worst-case response time 23.37ns.Compared with the synchronous 4-bit ACS processor in power consumption and performance by simulation,it reveals that the asynchronous ACS processor has some advantages than the synchronous one.

Stability of Iterative Learning Control with Data Dropouts via Asynchronous Dynamical System

In this paper, the stability of iterative learning control with data dropouts is discussed. By the super vector formulation, an iterative learning control （ILC） system with data dropouts can be modeled as an asynchronous dynamical system with rate constraints on events in the iteration domain. The stability condition is provided in the form of linear matrix inequalities （LMIS） depending on the stability of asynchronous dynamical systems. The analysis is supported by simulations.

Privacy Preserving Solution for the Asynchronous Localization of Underwater Sensor Networks

Location estimation of underwater sensor networks(USNs)has become a critical technology,due to its fundamental role in the sensing,communication and control of ocean volume.However,the asynchronous clock,security attack and mobility characteristics of underwater environment make localization much more challenging as compared with terrestrial sensor networks.This paper is concerned with a privacy-preserving asynchronous localization issue for USNs.Particularly,a hybrid network architecture that includes surface buoys,anchor nodes,active sensor nodes and ordinary sensor nodes is constructed.Then,an asynchronous localization protocol is provided,through which two privacy-preserving localization algorithms are designed to estimate the locations of active and ordinary sensor nodes.It is worth mentioning that,the proposed localization algorithms reveal disguised positions to the network,while they do not adopt any homomorphic encryption technique.More importantly,they can eliminate the effect of asynchronous clock,i.e.,clock skew and offset.The performance analyses for the privacy-preserving asynchronous localization algorithms are also presented.Finally,simulation and experiment results reveal that the proposed localization approach can avoid the leakage of position information,while the location accuracy can be significantly enhanced as compared with the other works.

Dynamic Coupled Analysis of the Floating Platform Using the Asynchronous Coupling Algorithm

This paper discusses the numerical modeling of the dynamic coupled analysis of the floating platform and mooring/risers using the asynchronous coupling algorithm with the purpose to improve the computational efficiency when multiple lines are connected to the platform. The numerical model of the platform motion simulation in wave is presented. Additionally, how the asynchronous coupling algorithm is implemented during the dynamic coupling analysis is introduced. Through a comparison of the numerical results of our developed model with commercial software for a SPAR platform, the developed numerical model is checked and validated.

Sampled-Data Asynchronous Fuzzy Output Feedback Control for Active Suspension Systems in Restricted Frequency Domain

This paper proposes a novel sampled-data asynchronous fuzzy output feedback control approach for active suspension systems in restricted frequency domain.In order to better investigate uncertain suspension dynamics,the sampleddata Takagi-Sugeno(T-S)fuzzy half-car active suspension(HCAS)system is considered,which is further modelled as a continuous system with an input delay.Firstly,considering that the fuzzy system and the fuzzy controller cannot share the identical premises due to the existence of input delay,a reconstructed method is employed to synchronize the time scales of membership functions between the fuzzy controller and the fuzzy system.Secondly,since external disturbances often belong to a restricted frequency range,a finite frequency control criterion is presented for control synthesis to reduce conservatism.Thirdly,given a full information of state variables is hardly available in practical suspension systems,a two-stage method is proposed to calculate the static output feedback control gains.Moreover,an iterative algorithm is proposed to compute the optimum solution.Finally,numerical simulations verify the effectiveness of the proposed controllers.

Application of the asynchronous advantage actor–critic machine learning algorithm to real-time accelerator tuning

This paper describes a real-time beam tuning method with an improved asynchronous advantage actor–critic(A3C)algorithm for accelerator systems.The operating parameters of devices are usually inconsistent with the predictions of physical designs because of errors in mechanical matching and installation.Therefore,parameter optimization methods such as pointwise scanning,evolutionary algorithms(EAs),and robust conjugate direction search are widely used in beam tuning to compensate for this inconsistency.However,it is difficult for them to deal with a large number of discrete local optima.The A3C algorithm,which has been applied in the automated control field,provides an approach for improving multi-dimensional optimization.The A3C algorithm is introduced and improved for the real-time beam tuning code for accelerators.Experiments in which optimization is achieved by using pointwise scanning,the genetic algorithm(one kind of EAs),and the A3C-algorithm are conducted and compared to optimize the currents of four steering magnets and two solenoids in the low-energy beam transport section(LEBT)of the Xi’an Proton Application Facility.Optimal currents are determined when the highest transmission of a radio frequency quadrupole(RFQ)accelerator downstream of the LEBT is achieved.The optimal work points of the tuned accelerator were obtained with currents of 0 A,0 A,0 A,and 0.1 A,for the four steering magnets,and 107 A and 96 A for the two solenoids.Furthermore,the highest transmission of the RFQ was 91.2%.Meanwhile,the lower time required for the optimization with the A3C algorithm was successfully verified.Optimization with the A3C algorithm consumed 42%and 78%less time than pointwise scanning with random initialization and pre-trained initialization of weights,respectively.

Towards asynchronous federated learning for heterogeneous edge-powered internet of things

The advancement of the Internet of Things(IoT)brings new opportunities for collecting real-time data and deploying machine learning models.Nonetheless,an individual IoT device may not have adequate computing resources to train and deploy an entire learning model.At the same time,transmitting continuous real-time data to a central server with high computing resource incurs enormous communication costs and raises issues in data security and privacy.Federated learning,a distributed machine learning framework,is a promising solution to train machine learning models with resource-limited devices and edge servers.Yet,the majority of existing works assume an impractically synchronous parameter update manner with homogeneous IoT nodes under stable communication connections.In this paper,we develop an asynchronous federated learning scheme to improve training efficiency for heterogeneous IoT devices under unstable communication network.Particularly,we formulate an asynchronous federated learning model and develop a lightweight node selection algorithm to carry out learning tasks effectively.The proposed algorithm iteratively selects heterogeneous IoT nodes to participate in the global learning aggregation while considering their local computing resource and communication condition.Extensive experimental results demonstrate that our proposed asynchronous federated learning scheme outperforms the state-of-the-art schemes in various settings on independent and identically distributed(i.i.d.)and non-i.i.d.data distribution.

ASYNCHRONOUS RELAXED ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS OF EQUATIONS

In this paper, the asynchronous versions of classical iterative methods for solving linear systems of equations are considered. Sufficient conditions for convergence of asynchronous relaxed processes are given for H-matrix by which nor only the requirements of [3] on coefficient matrix are lowered, but also a larger region of convergence than that in [3] is obtained.

THE RESEARCH OF GRADATION FUSION ALGORITHM BASED ON MULTISENSOR ASYNCHRONOUS SAMPLING SYSTEM

This letter explores the distributed multisensor dynamic system, which has uniform sampling velocity and asynchronous sampling data for different sensors, and puts forward a new gradation fusion algorithm of multisensor dynamic system. As the total forecasted increment value between the two adjacent moments is the forecasted estimate value of the corresponding state increment in the fusion center, the new algorithm models the state and the forecasted estimate value of every moment. Kalman filter and all measurements arriving sequentially in the fusion period are employed to update the evaluation of target state step by step, on the condition that the system has obtained the target state evaluation that is based on the overall information in the previous fusion period. Accordingly, in the present period, the fusion evaluation of the target state at each sampling point on the basis of the overall information can be obtained. This letter elaborates the form of this new algorithm. Computer simulation demonstrates that this new algorithm owns greater precision in estimating target state than the present asynchronous fusion algorithm calibrated in time does.

Harmonics in the Squirrel Cage Induction Motor Analytic Calculation-Part Ⅰ: Differential Leakage, Attenuation, Asynchronous Parasitic Torques

The magnetic field generated in the air gap of the cage asynchronous machine and the harmonics of the magnetomotive forces creating that magnetic field, as well as the related differential leakage, attenuation, asynchronous parasitic torques have been discussed in great detail in the literature, but always separately, for a long time. However, systematization of the phenomenon still awaits. Therefore, it is worth summarizing the completeness of the phenomena in a single study – with a new approach at the same time-in order to reveal the relationships between them. The role of rotor slot number is emphasized much more than before. An existing, commonly used, but still impractical basic figure has been modified to more clearly demonstrate the response of the rotor for the harmonics of the stator. The need to treat differential leakage, asynchronous parasitic torques and attenuation together will be demonstrated: new formula for asynchronous parasitic torque is derived;the long-used characteristic curves for differential leakage and attenuation used separately so far was merged into one, correct curve in order to provide a correct design guide for the engineers.

Analysis and Modeling of Wangqing Oil Shale Drying Characteristics in a Novel Fluidized Bed Dryer with Asynchronous Rotating Air Distributor

In order to replace the conventional distributor, a novel asynchronous rotating air distributor, which can optimize the drying ability of fluidized bed and strengthen the drying performance of oil shale particles, is creatively designed in this study. The rotating speed of the asynchronous rotating air distributor with an embedded center disk and an encircling disk is regulated to achieve the different air supply conditions. The impacts of different drying conditions on the drying characteristic of Wangqing oil shale particles are studied with the help of electronic scales. The dynamics of experimental data is analyzed with 9 common drying models. The results indicate that the particles distribution in fluidized bed can be improved and the drying time can be reduced by decreasing the rotating speed of the embedded center disk and increasing the rotating speed of the encircling disk. The drying process of oil shale particles involves a rising drying rate period, a constant drying rate period and a falling drying rate period. Regulating the air distributor rotating speed reasonably will accelerate the shift of particles from the rising drying rate period to the falling drying rate period directly. The two-term model fits properly the oil shale particles drying simulation among 9 drying models at different air supply conditions. Yet the air absorbed in the particles' pores is diffused along with the moisture evaporation, and a small amount of moisture remains on the wall of fluidized bed in each experiment, thus, the values of drying simulation are less than the experimental values.

Asynchronous abdominal wall and sigmoid metastases in clear cell renal cell carcinoma: A case report and literature review

Sigmoid metastasis of renal cell carcinoma(RCC)is very rare.Herein we report a case of pathologically proven asynchronous abdominal wall and sigmoid metastases after a right nephrectomy.An 84-year-old man underwent right radical nephrectomy for clear cell renal cell carcinoma(ccRCC)13 years ago.Solitary contralateral abdominal wall metastasis was found for left abdominal mass 9 years after nephrectomy.The man experienced melena underwent resection of sigmoid colon tumor in February,2016.The postoperative pathological examinations revealed that the tumors were metastases of ccRCC.Recurrence more than 5 years after nephrectomy has been accepted as late recurrence by the majority of urologists now.Late recurrence is one of the specific biological behaviors of RCC.Asynchronous late recurrence of abdominal wall and sigmoid metastases in ccRCC has not been reported before.When patients have sigmoid mass after nephrectomy for RCC,doctors may consider the possibility of late recurrence.

The Paralleling of High Power High Frequency Amplifier Based on Synchronous and Asynchronous Control

The vertical position of plasma in the HT-7U Tokamak is inherently unstable. In order to realize active stabilization, the response rate of the high-power high-frequency amplifier feeding the active control coils must be fast enough. This paper analyzes the paralleling scheme of the power amplifier through two kinds of control mode. One is the synchronous control; the other is the asynchronous control. Via the comparison of the two kinds of control mode, both of their characteristics are given in the text. At last, the analyzed result is verified by a small power experiment.

Asynchronous Secret Reconstruction and Its Application to the Threshold Cryptography

In Shamir’s(t,n) threshold of the secret sharing scheme, a secret is divided into n shares by a dealer and is shared among n shareholders in such a way that (a) the secret can be reconstructed when there are t or more than t shares;and (b) the secret cannot be obtained when there are fewer than t shares. In the secret reconstruction, participating users can be either legitimate shareholders or attackers. Shamir’s scheme only considers the situation when all participating users are legitimate shareholders. In this paper, we show that when there are more than t users participating and shares are released asynchronously in the secret reconstruction, an attacker can always release his share last. In such a way, after knowing t valid shares of legitimate shareholders, the attacker can obtain the secret and therefore, can successfully impersonate to be a legitimate shareholder without being detected. We propose a simple modification of Shamir’s scheme to fix this security problem. Threshold cryptography is a research of group-oriented applications based on the secret sharing scheme. We show that a similar security problem also exists in threshold cryptographic applications. We propose a modified scheme to fix this security problem as well.