检索结果-内蒙古大学图书馆

Robust Imagined Speech Production from Electrocorticography with Adaptive Frequency Enhancement

学校读者我要写书评

暂无评论

Robust Imagined Speech Production from Electrocorticography ...

International Joint Conference on Neural Networks (IJCNN)

作者： Xu Xu Chong Fu Junxin Chen Gwanggil Jeon David Camacho School of Computer Science and Engineering Northeastern University Shenyang China School of Software Dalian University of Technology Dalian China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Shenyang China Engineering Research Center of Security Technology of Complex Network System Ministry of Education Shenyang China College of Information Technology Incheon National University Incheon Korea Department of Computer Systems Engineering Universidad Politécnica de Madrid Madrid Spain

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Imagined speech production with electrocorticography (ECoG) plays a crucial role in brain-computer interface system. A challenging issue is the great variation underlying the frequency bands of the ECoG signals’ encode information, which makes current methods difficult to generate imagined speech with stable quality among different persons. To this end, we propose a robust model to generate high-quality imagined speech from ECoG. A frequency enhancement branch is first designed to adaptively modulate the frequency information, whose product is fed into the following multi-scale channel attention module for robust feature extraction and fusion. By incorporating both the mel-spectrum and audio as training constraints, a multi-constraint decoder branch is finally constructed for imagined speech production. The performance of our model is evaluated on a high-quality dateset, i.e, Single Word Production Dutch-iBIDS. It yields Pearson correlation scores that are all above 0.8, and the standard deviationsare are all below 0.2 in different volunteers. Experimental results demonstrate that our model is effective and robust for ECoG based imagined speech production, and has advantages over peer methods.

关键词： Training Adaptation models Frequency modulation Correlation Neuroscience Production Speech enhancement

TransWorldNG: Traffic Simulation via Foundation Model

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wang, Ding Wang, Xuhong Chen, Liang Yao, Shengyue Jing, Ming Li, Honghai Li, Li Bao, Shiqiang Wang, Fei-Yue Lin, Yilun Urban Computing Lab Shanghai Artificial Intelligence Laboratory Shanghai China 51 World Shanghai China Research and Development Center of Transport Industry of Autonomous Driving Technology RIOH High and Technology Group China Department of Automation Tsinghua University Beijing China Institute of Automation Chinese Academy of Sciences Beijing China Macau Institute of Systems Engineering Macau University of Science and Technology China

关键词： Decision making

Assessing transfer entropy from biochemical data

学校读者我要写书评

暂无评论

Physical Review E 2022年第3期105卷 034403-034403页

作者： Takuya Imaizumi Nobuhisa Umeki Ryo Yoshizawa Tomoyuki Obuchi Yasushi Sako Yoshiyuki Kabashima Department of Mathematical and Computing Science Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo 152-8550 Japan Cellular Informatics Laboratory RIKEN Cluster for Pioneering Research 2-1 Hirosawa Wako 351-0198 Saitama Japan Department of Systems Science Kyoto University 36-1 Yoshida-Honmachi Sakyo-ku Kyoto 606-8501 Japan Institute for Physics of Intelligence The University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo 113-0033 Japan

We address the problem of evaluating the transfer entropy (TE) produced by biochemical reactions from experimentally measured data. Although these reactions are generally nonlinear and nonstationary processes making it challenging to achieve accurate modeling, Gaussian approximation can facilitate the TE assessment only by estimating covariance matrices using multiple data obtained from simultaneously measured time series representing the activation levels of biomolecules such as proteins. Nevertheless, the nonstationary nature of biochemical signals makes it difficult to theoretically assess the sampling distributions of TE, which are necessary for evaluating the statistical confidence and significance of the data-driven estimates. We resolve this difficulty by computationally assessing the sampling distributions using techniques from computational statistics. The computational methods are tested by using them in analyzing data generated from a theoretically tractable time-varying signal model, which leads to the development of a method to screen only statistically significant estimates. The usefulness of the developed method is examined by applying it to real biological data experimentally measured from the ERBB-RAS-MAPK system that superintends diverse cell fate decisions. A comparison between cells containing wild-type and mutant proteins exhibits a distinct difference in the time evolution of TE while any apparent difference is hardly found in average profiles of the raw signals. Such a comparison may help in unveiling important pathways of biochemical reactions.

关键词： Biomolecular interactions Communication measures Intracellular signalling Nonequilibrium statistical mechanics

GradSA: Gradient Sparsification and Accumulation for Communication-Efficient Distributed Deep Learning 15th

学校读者我要写书评

暂无评论

GradSA: Gradient Sparsification and Accumulation for Communi...

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Liu, Bo Jiang, Wenbin Zhao, Shaofeng Jin, Hai He, Bingsheng National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Huazhong University of Science and Technology Wuhan China Library Henan University of Economics and Law Zhengzhou China Department of Computer Science School of Computing National University of Singapore Singapore Singapore

ISBN: (纸本)9783030642426

Large-scale distributed deep learning is of great importance in various applications. For distributed training, the inter-node gradient communication often becomes the performance bottleneck. Gradient sparsification has been proposed to reduce the communication overhead. However, the sparsification only arbitrarily selects a small fraction of gradients, while the efficiency of selection dimension has been overlooked. Furthermore, gradient staleness is inevitable after applying the sparsification which will ultimately lead to model divergence. In this paper, we propose a staleness-compensated sparse stochastic gradient descent algorithm, GradSA, to improve the training efficiency. Layer-level gradients are sparsified to reduce the communication overhead, which conform to the characteristics of the network structure, and historical accumulation of the approximated gradients is utilized to speed up convergence. We demonstrate the model convergence acceleration and the efficiency of our layer-level selection over existing state-of-the-art works, such as DGC, TernGrad, and 8-Bit quantization. © 2020, Springer Nature Switzerland AG.

关键词： Efficiency

Towards Communication-efficient Federated Learning via Sparse and Aligned Adaptive Optimization

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Deng, Xiumei Li, Jun Wei, Kang Shi, Long Xiong, Zeihui Ding, Ming Chen, Wen Jin, Shi Poor, H. Vincent School of Electronic and Optical Engineering Nanjing University of Science and Technology Nanjing210094 China The Department of Computing Hong Kong Polytechnic University 999077 Hong Kong The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Data61 CSIRO SydneyNSW2015 Australia Department of Electronics Engineering Shanghai Jiao Tong University Shanghai200240 China The National Mobile Communications Research Laboratory Southeast University Nanjing210096 China Department of Electrical and Computer Engineering Princeton University NJ08544 United States

Adaptive moment estimation (Adam), as a Stochastic Gradient Descent (SGD) variant, has gained widespread popularity in federated learning (FL) due to its fast convergence. However, federated Adam (FedAdam) algorithms suffer from a threefold increase in uplink communication overhead compared to federated SGD (FedSGD) algorithms, which arises from the necessity to transmit both local model updates and first and second moment estimates from distributed devices to the centralized server for aggregation. Driven by this issue, we propose a novel sparse FedAdam algorithm called FedAdam-SSM, wherein distributed devices sparsify the updates of local model parameters and moment estimates and subsequently upload the sparse representations to the centralized server. To further reduce the communication overhead, the updates of local model parameters and moment estimates incorporate a shared sparse mask (SSM) into the sparsification process, eliminating the need for three separate sparse masks. Theoretically, we develop an upper bound on the divergence between the local model trained by FedAdam-SSM and the desired model trained by centralized Adam, which is related to sparsification error and imbalanced data distribution. By minimizing the divergence bound between the model trained by FedAdam-SSM and centralized Adam, we optimize the SSM to mitigate the learning performance degradation caused by sparsification error. Additionally, we provide convergence bounds for FedAdam-SSM in both convex and non-convex objective function settings, and investigate the impact of local epoch, learning rate and sparsification ratio on the convergence rate of FedAdam-SSM. Experimental results show that FedAdam-SSM outperforms baselines in terms of convergence rate (over 1.1× faster than the sparse FedAdam baselines) and test accuracy (over 14.5% ahead of the quantized FedAdam baselines). Copyright © 2024, The Authors. All rights reserved.

关键词： Stochastic systems

Asynchronous Activity Detection for Cell-Free Massive MIMO: From Centralized to Distributed Algorithms

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Yang Lin, Qingfeng Liu, Ya-Feng Ai, Bo Wu, Yik-Chung Shenzhen Research Institute of Big Data Shenzhen518172 China State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China The Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Peng Cheng Laboratory Shenzhen518055 China Henan Joint International Research Laboratory of Intelligent Networking and Data Analysis Zhengzhou University Zhengzhou450001 China

Device activity detection in the emerging cell-free massive multiple-input multiple-output (MIMO) systems has been recognized as a crucial task in machine-type communications, in which multiple access points (APs) jointly identify the active devices from a large number of potential devices based on the received signals. Most of the existing works addressing this problem rely on the impractical assumption that different active devices transmit signals synchronously. However, in practice, synchronization cannot be guaranteed due to the low-cost oscillators, which brings additional discontinuous and nonconvex constraints to the detection problem. To address this challenge, this paper reveals an equivalent reformulation to the asynchronous activity detection problem, which facilitates the development of a centralized algorithm and a distributed algorithm that satisfy the highly nonconvex constraints in a gentle fashion as the iteration number increases, so that the sequence generated by the proposed algorithms can get around bad stationary points. To reduce the capacity requirements of the fronthauls, we further design a communication-efficient accelerated distributed algorithm. Simulation results demonstrate that the proposed centralized and distributed algorithms outperform state-of-the-art approaches, and the proposed accelerated distributed algorithm achieves a close detection performance to that of the centralized algorithm but with a much smaller number of bits to be transmitted on the fronthaul links. Copyright © 2022, The Authors. All rights reserved.

关键词： Internet of things

Unity makes strength: Coalition Formation-based Group-buying for Timely UAV Data Collection

学校读者我要写书评

暂无评论

Unity makes strength: Coalition Formation-based Group-buying...

GLOBECOM 2022 - 2022 IEEE Global Communications Conference

作者： Nan Qi Yeting Huang Wen Sun Shi Jin Theodoros A. Tsiftsis Qihui Wu Xiang Su National Mobile Communications Research Laboratory Southeast University Nanjing China College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics Nanjing China School of Cyber Science and Engineering Southeast University Nanjing China School of Intelligent Systems Science & Engineering Jinan University Zhuhai China Department of Computer Science Norwegian University of Science and Technology Gjøvik Norway Center for Ubiquitous Computing University of Oulu Oulu Finland

ISBN: (纸本)9781665435413

With their high mobility, unmanned aerial vehicles (UAVs) become appealing data collectors in hard-to-reach wide-area distributed sensor networks. Different from existing works focusing on the perspective of UAVs for service order optimization and UAV utility maximization, we consider the utilities of both sensors and UAVs, and innovatively model the competition among sensors (buyers) for the service of UAVs (sellers) as an auction game. A “unity makes strength” strategy is exploited. That is, to strengthen the bidding competitiveness, a group-buying coalition auction method that encourages sensors to form coalitions to bid for UAV service is proposed. Besides, we propose a parallel variable neighborhood ascent search algorithm, we can quickly determine the approximately optimal group-buying coalition structure. Numerical results show that the proposed method outperforms the joint trajectory design-task scheduling (TDTS) UAV-to-community method and the single coalition formation game (CFG) method.

关键词： Wireless sensor networks Games Data collection Autonomous aerial vehicles Search problems Information age Trajectory

Single-shot blind deconvolution with coded aperture

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Muneta, Hideyuki Horisaki, Ryoichi Nishizaki, Yohei Naruse, Makoto Tanida, Jun Department of Information and Physical Sciences Graduate School of Information Science and Technology Osaka University 1-5 Yamadaoka Osaka Suita565-0871 Japan Department of Information Physics and Computing Graduate School of Information Science and Technology The University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo113-8656 Japan Systems and Control Laboratory Environmental Technology Research Division Osaka Research Institute of Industrial Science and Technology 1-6-50 Morinomiya Joto-ku Osaka536-8553 Japan

In this paper, we present a method for single-shot blind deconvolution incorporating a coded aperture (CA). In this method, we utilize the CA, inserted on the pupil plane, as support constraints in blind deconvolution. Not only an object but also a point spread function of turbulence are estimated from a single captured image by a reconstruction algorithm with the CA support. The proposed method is demonstrated by a simulation and an experiment in which point sources are recovered under severe turbulence. © 2022, CC BY.

关键词： Convolution

Reachability of Black-Box Nonlinear systems after Koopman Operator Linearization

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2021年第5期54卷 253-258页

作者： Stanley Bak Sergiy Bogomolov Parasara Sridhar Duggirala Adam R. Gerlach Kostiantyn Potomkin Department of Computer Science Stony Brook University NY USA School of Computing Newcastle University Newcastle Upon Tyne UK Department of Computer Science University of North Carolina at Chapel Hill NC USA Aerospace Systems Directorate United State Air Force Research Laboratory Wright–Patterson Air Force Base OH USA

Reachability analysis of nonlinear dynamical systems is a challenging and computationally expensive task. computing the reachable states for linear systems, in contrast, can often be done efficiently in high dimensions. In this paper, we explore verification methods that leverage a connection between these two classes of systems based on the concept of the Koopman operator. The Koopman operator links the behaviors of a nonlinear system to a linear system embedded in a higher dimensional space, with an additional set of so-called observable variables. Although the new dynamical system has linear differential equations, the set of initial states is defined with nonlinear constraints. For this reason, existing approaches for linear systems reachability cannot be used directly. We propose the first reachability algorithm that deals with this unexplored type of reachability problem. Our evaluation examines several optimizations, and shows the proposed workflow is a promising avenue for verifying behaviors of nonlinear systems.

关键词： Reachability Analysis Nonlinear systems Koopman Operator