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

The applied principles of EEG analysis methods in neuroscience and clinical neurology

Military Medical Research 2024年第6期11卷 907-941页

作者： Hao Zhang Qing-Qi Zhou He Chen Xiao-Qing Hu Wei-Guang Li Yang Bai Jun-Xia Han Yao Wang Zhen-Hu Liang Dan Chen Feng-Yu Cong Jia-Qing Yan Xiao-Li Li School of Systems Science Beijing Normal UniversityBeijing 100875China College of Electrical and Control Engineering North China University of TechnologyBeijing 100041China School of Automation Science and Engineering South China University of TechnologyGuangzhou 510641China Department of Psychology the State Key Laboratory of Brain and Cognitive Sciencesthe University of Hong KongHong Kong SAR 999077China HKU-Shenzhen Institute of Research and Innovation Shenzhen 518057GuangdongChina Department of Health Technology and Informatics the Hong Kong Polytechnic UniversityHong Kong SAR 999077China Department of Rehabilitation Medicine the First Afliated Hospital of Nanchang UniversityNanchang 330006China Rehabilitation Medicine Clinical Research Center of Jiangxi Province Nanchang 330006China Beijing Key Laboratory of Learning and Cognition School of PsychologyCapital Normal UniversityBeijing 100048China School of Communication Science Beijing Language and Culture UniversityBeijing 100083China Institute of Electrical Engineering Yanshan UniversityQinhuangdao 066004HebeiChina School of Computer Science Wuhan UniversityWuhan 430072China School of Biomedical Engineering Faculty of Electronic Information and Electrical EngineeringDalian University of TechnologyDalian 116081LiaoningChina Guangdong Artifcial Intelligence and Digital Economy Laboratory(Guangzhou) Guangzhou 510335China.

Electroencephalography(EEG)is a non-invasive measurement method for brain *** to its safety,high resolution,and hypersensitivity to dynamic changes in brain neural signals,EEG has aroused much interest in scientific research and medical *** article reviews the types of EEG signals,multiple EEG signal analysis methods,and the application of relevant methods in the neuroscience feld and for diagnosing neurological ***,3 types of EEG signals,including time-invariant EEG,accurate event-related EEG,and random event-related EEG,are ***,5 main directions for the methods of EEG analysis,including power spectrum analysis,time-frequency analysis,connectivity analysis,source localization methods,and machine learning methods,are described in the main section,along with diferent sub-methods and effect evaluations for solving the same ***,the application scenarios of different EEG analysis methods are emphasized,and the advantages and disadvantages of similar methods are *** article is expected to assist researchers in selecting suitable EEG analysis methods based on their research objectives,provide references for subsequent research,and summarize current issues and prospects for the future.

关键词： Electroencephalogram analysis methods Applied principles Neuroscience Diagnosis Neurological diseases

来源：评论

学校读者我要写书评

暂无评论

Tackling Noisy Labels with Network Parameter Additive Decomposition

arXiv

引用

arXiv 2024年

作者： Wang, Jingyi Xia, Xiaobo Lan, Long Wu, Xinghao Yu, Jun Yang, Wenjing Han, Bo Liu, Tongliang The Department of Intelligent Data Science College of Computer Science and Technology National University of Defense Technology Changsha410073 China The Trustworthy Machine Learning Lab School of Computer Science Faculty of Engineering University of Sydney DarlingtonNSW2008 Australia The State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing100191 China The Department of Automation University of Science and Technology of China Hefei230026 China The Department of Computer Science Hong Kong Baptist University Hong Kong

Given data with noisy labels, over-parameterized deep networks suffer overfitting mislabeled data, resulting in poor generalization. The memorization effect of deep networks shows that although the networks have the ability to memorize all noisy data, they would first memorize clean training data, and then gradually memorize mislabeled training data. A simple and effective method that exploits the memorization effect to combat noisy labels is early stopping. However, early stopping cannot distinguish the memorization of clean data and mislabeled data, resulting in the network still inevitably overfitting mislabeled data in the early training stage. In this paper, to decouple the memorization of clean data and mislabeled data, and further reduce the side effect of mislabeled data, we perform additive decomposition on network parameters. Namely, all parameters are additively decomposed into two groups, i.e. , parameters w are decomposed as w = σ + γ. Afterward, the parameters σ are considered to memorize clean data, while the parameters γ are considered to memorize mislabeled data. Benefiting from the memorization effect, the updates of the parameters σ are encouraged to fully memorize clean data in early training, and then discouraged with the increase of training epochs to reduce interference of mislabeled data. The updates of the parameters γ are the opposite. In testing, only the parameters σ are employed to enhance generalization. Extensive experiments on both simulated and real-world benchmarks confirm the superior performance of our method. The implementation is available at: https://***/wangjingyi9924/TNLPAD. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

GSLB: The Graph Structure learning Benchmark

arXiv

引用

arXiv 2023年

作者： Li, Zhixun Wang, Liang Sun, Xin Luo, Yifan Zhu, Yanqiao Chen, Dingshuo Luo, Yingtao Zhou, Xiangxin Liu, Qiang Wu, Shu Yu, Jeffrey Xu Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Hong Kong Center for Research on Intelligent Perception Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences China School of Artificial Intelligence University of Chinese Academy of Sciences China Department of Automation University of Science and Technology of China China School of Cyberspace Security Beijing University of Posts and Telecommunications China Department of Computer Science University of California Los Angeles United States Heinz College of Information Systems and Public Policy Machine Learning Department School of Computer Science Carnegie Mellon University United States

Graph Structure learning (GSL) has recently garnered considerable attention due to its ability to optimize both the parameters of Graph Neural Networks (GNNs) and the computation graph structure simultaneously. Despite the proliferation of GSL methods developed in recent years, there is no standard experimental setting or fair comparison for performance evaluation, which creates a great obstacle to understanding the progress in this field. To fill this gap, we systematically analyze the performance of GSL in different scenarios and develop a comprehensive Graph Structure learning Benchmark (GSLB) curated from 20 diverse graph datasets and 16 distinct GSL algorithms. Specifically, GSLB systematically investigates the characteristics of GSL in terms of three dimensions: effectiveness, robustness, and complexity. We comprehensively evaluate state-of-the-art GSL algorithms in node- and graph-level tasks, and analyze their performance in robust learning and model complexity. Further, to facilitate reproducible research, we have developed an easy-to-use library for training, evaluating, and visualizing different GSL methods. Empirical results of our extensive experiments demonstrate the ability of GSL and reveal its potential benefits on various downstream tasks, offering insights and opportunities for future research. The code of GSLB is available at: https://***/GSL-Benchmark/GSLB. © 2023, CC BY.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Prognostic Prediction for Non-small-Cell Lung Cancer Based on Deep Neural Network and Multimodal Data 17th

Prognostic Prediction for Non-small-Cell Lung Cancer Based o...

引用

17th International Conference on Intelligent Computing, ICIC 2021

作者： Zhang, Zhong-Si Xu, Fei Jiang, Han-Jing Chen, Zhan-Heng Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Institute of Machine Learning and Systems Biology School of Electronics and Information Engineering Tongji University No. 4800 Caoan Road Shanghai201804 China

ISBN: (纸本)9783030845315

Non-small-cell lung cancer (NSCLC) is the most common lung cancer with poor prognosis. Prognostic prediction is significant in improving the prognosis of NSCLC patients. Clinical information and multi-omics data including gene expression, miRNA, copy number variations, and DNA methylation are closely related to NSCLC prognosis. In this study, we propose a deep neural network to conduct prognostic prediction for NSCLC patients based on all five types of data. Given the high dimensional features of the omics data, past works reduce the feature dimension by regression analysis or correlation sorting algorithms. A shortcoming of these methods is that only a small number of features are considered. To overcome it, we propose a convolution neural network-based feature transformation method, which considers all features and extracts the abstract representations of the omics data. Based on the representations, we predict the five-year survival status of NSCLC patients. The results show that our method achieves a more precise prediction than previous work, with the areas under the curve improved from 0.8163 to 0.8508 and the accuracy improved from 0.7544 to 0.8096. © 2021, Springer Nature Switzerland AG.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Tracking one-in-a-million: Large-scale benchmark for microbial single-cell tracking with experiment-aware robustness metrics

arXiv

引用

arXiv 2024年

作者： Seiffarth, Johannes Blöbaum, Luisa Paul, Richard D. Friederich, Nils Yamachui Sitcheu, Angelo Jovin Mikut, Ralf Scharr, Hanno Grünberger, Alexander Nöh, Katharina Institute of Bio- and Geosciences IBG-1: Biotechnology Forschungszentrum Jülich GmbH Jülich Germany RWTH Aachen University Aachen Germany Multiscale Bioengineering Bielefeld University Bielefeld Germany Institute for Advanced Simulation IAS-8: Data Analytics and Machine Learning Forschungszentrum Jülich GmbH Jülich Germany Institute for Automation and Applied Informatics Karlsruhe Institute of Technology Eggenstein-Leopoldshafen Germany Institute of Biological and Chemical Systems Karlsruhe Institute of Technology Eggenstein-Leopoldshafen Germany Microsystems in Bioprocess Engineering Karlsruhe Institute of Technology Karlsruhe Germany

Tracking the development of living cells in live-cell time-lapses reveals crucial insights into single-cell behavior and presents tremendous potential for biomedical and biotechnological applications. In microbial live-cell imaging (MLCI), a few to thousands of cells have to be detected and tracked within dozens of growing cell colonies. The challenge of tracking cells is heavily influenced by the experiment parameters, namely the imaging interval and maximal cell number. For now, tracking benchmarks are not widely available in MLCI and the effect of these parameters on the tracking performance are not yet known. Therefore, we present the largest publicly available and annotated dataset for MLCI, containing more than 1.4 million cell instances, 29k cell tracks, and 14k cell divisions. With this dataset at hand, we generalize existing tracking metrics to incorporate relevant imaging and experiment parameters into experiment-aware metrics. These metrics reveal that current cell tracking methods crucially depend on the choice of the experiment parameters, where their performance deteriorates at high imaging intervals and large cell colonies. Thus, our new benchmark quantifies the influence of experiment parameters on the tracking quality, and gives the opportunity to develop new data-driven methods that generalize across imaging and experiment parameters. The benchmark dataset is publicly available at https://***/doi/10.5281/zenodo.7260136. © 2024, CC BY.

关键词： Cytology

来源：评论

学校读者我要写书评

暂无评论

Rethinking Wireless Communication Security in Semantic Internet of Things

arXiv

引用

arXiv 2022年

作者： Du, Hongyang Wang, Jiacheng Niyato, Dusit Kang, Jiawen Xiong, Zehui Guizani, Mohsen Kim, Dong In The School of Computer Science and Engineering Nanyang Technological University Singapore The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Machine Learning Department Mohamed Bin Zayed University of Artificial Intelligence Abu Dhabi United Arab Emirates The Department of Electrical and Computer Engineering Sungkyunkwan University Korea Republic of

Semantic communication is an important participant in the next generation of wireless communications. Enabled by this novel paradigm, the conventional Internet-of-Things (IoT) is evolving toward the semantic IoT (SIoT) to achieve significant system performance improvements. However, traditional wireless communication security techniques for bit transmission cannot be applied directly to the SIoT that focuses on semantic information transmission. One key reason is the lack of new security performance indicators. Thus, we have to rethink the wireless communication security in the SIoT. As such, in the paper, we analyze and compare classical security techniques, i.e., physical layer security, covert communications, and encryption, from the perspective of semantic information security. We highlight the differences among these security techniques when applied to the SIoT. Novel performance indicators such as semantic secrecy outage probability (for physical layer security techniques) and detection error expectation (for covert communication techniques) are proposed. Considering that semantic communications can raise new security issues, we then review attack and defense methods at the semantic level. Finally, we present several promising directions for future secure SIoT research. © 2022, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Graph neural networks-based Scheduler for Production planning problems using Reinforcement learning

arXiv

引用

arXiv 2020年

作者： Hameed, Mohammed Sharafath Abdul Schwung, Andreas Department of Automation Technology and Learning Systems South Westphalia University of Applied Sciences Soest59494 Germany

Reinforcement learning (RL) is increasingly adopted in job shop scheduling problems (JSSP). But RL for JSSP is usually done using a vectorized representation of machine features as the state space. It has three major problems: (1) the relationship between the machine units and the job sequence is not fully captured, (2) exponential increase in the size of the state space with increasing machines/jobs, and (3) the generalization of the agent to unseen scenarios. This paper presents a novel framework named GraSP-RL, GRAph neural network-based Scheduler for Production planning problems using Reinforcement learning. It represents JSSP as a graph and trains the RL agent using features extracted using a graph neural network (GNN). While the graph is itself in the non-euclidean space, the features extracted using the GNNs provide a rich encoding of the current production state in the euclidean space. At its core is a custom message-passing algorithm applied to the GNN. The node features encoded by the GNN are then used by the RL agent to select the next job. Further, we cast the scheduling problem as a decentralized optimization problem in which the learning agent is assigned to all the production units individually and the agent learns asynchronously from the experience collected on all the other production units. The GraSP-RL is then applied to a complex injection molding production environment with 30 jobs and 4 machines. The task is to minimize the makespan of the production plan. The schedule planned by GraSP-RL is then compared and analyzed with a priority dispatch rule algorithm like first-in-first-out (FIFO) and metaheuristics like tabu search (TS) and genetic algorithm (GA). The proposed GraSP-RL outperforms the FIFO, TS, and GA for the trained task of planning 30 jobs in JSSP. We further test the generalization capability of the trained agent on two different problem classes: Open shop system (OSS) and Reactive JSSP (RJSSP). In these modified problem classes our

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Capacitor Minimization in Analog Synapses for Efficient and Compact Binarized SNNs

IEEE Transactions on Circuits and Systems for Artificial Int...

引用

IEEE Transactions on Circuits and systems for Artificial Intelligence 2025年第2期2卷 114-125页

作者： Mikail Yayla Ming-Liang Wei Simon Thomann Albi Mema Chia-Lin Yang Jian-Jia Chen Hussam Amrouch Design Automation for Embedded Systems Group TU Dortmund University Dortmund Germany Lamarr Institute for Machine Learning and Artificial Intelligence Dortmund Germany Department of the Graduate Institute of Electronics Engineering National Taiwan University Taipei Taiwan Technical University of Munich (TUM) Munich Germany TUM School of Computation Information and Technology Chair of AI Processor Design Munich Institute of Robotics and Machine Intelligence Munich Germany Department of Computer Science and Information Engineering Graduate Institute of Electronics Engineering National Taiwan University Taipei Taiwan Department of Computer Science TU Dortmund University Dortmund Germany Lamarr Institute Dortmund Germany

Accelerating the immense workloads of Neural Networks (NNs) is a critical challenge, and analog computing-based approaches present a promising solution. Among these, the Integrate-and-Fire (IF) Spiking Neural Network (SNN) stands out for its potential in efficient neural computation. However, achieving high inference accuracy through precise multiply-accumulate (MAC) operations necessitates a large membrane capacitor—224 to 547 times larger than the synapse array at the 14nm technology node—resulting in prohibitive area costs. Additionally, the large capacitor size introduces higher energy consumption and longer access times. Thus, a key research challenge is maintaining accuracy while mitigating the costs associated with the large membrane capacitor. In this work, we propose a HW/SW Codesign method, called CapMin, for capacitor size minimization in analog computing IF-SNNs. CapMin minimizes the capacitor size by reducing the number of spike times needed for accurate operation of the HW, based on the absolute frequency of MAC level occurrences in the SW. To increase the operation of IF-SNNs to current variation, we propose the method CapMin-V, which trades capacitor size for protection based on the reduced capacitor size found in CapMin. In our experiments, CapMin achieves more than a 14 $\times$ reduction in capacitor size along with a 34% reduction in energy consumption over the state of the art, while CapMin-V achieves increased variation tolerance in the IF-SNN operation, requiring only a small increase in capacitor size.

关键词： Capacitors Circuits Accuracy Capacitance Micromechanical devices Costs Neurons Integrated circuit modeling Spiking neural networks Hardware

来源：评论

学校读者我要写书评

暂无评论

Joint Parking and Power Management for Electric Vehicle Edge Computing: A Bilevel Optimization Approach

Joint Parking and Power Management for Electric Vehicle Edge...

引用

International Wireless Communications and Mobile Computing Conference, IWCMC

作者： Xumin Huang Weifeng Zhong Jiangtian Nie Jiawen Kang Zehui Xiong Yuan Wu Mohsen Guizani School of Automation Guangdong University of Technology Guangzhou China State Key Laboratory of Internet of Things for Smart City University of Macau Macau China School of Computer Science and Engineering Nanyang Technological University Singapore Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Department of Computer and Information Science University of Macau Macau China Machine Learning Department Mohamed Bin Zayed University of Artificial Intelligence Abu Dhabi UAE

With the vehicle-to-grid and computing capabilities, a parked electric vehicle (EV) has a dual role, namely being an energy prosumer as well as a computing node for accommodating computation-offloading services. This dual-role feature of EVs yields a new computing paradigm named Electric Vehicle Edge Computing (EVEC). To ease the implementation of EVEC, we propose a fine-grained EV management approach to jointly provide parking guidance for EVs and control their charging/discharging power in parking lots. We formulate a bilevel optimization problem where the top-level problem optimizes the matching between EVs and parking lots from the perspective of computation offloading, and the bottom-level problem optimizes the control of EV charging/discharging power from the view of power networks. We transform the bilevel optimization problem into a single-level form, which is a nonconvex mixed-integer nonlinear programming problem, and we further tackle it by linearization techniques. Finally, we provide numerical results to demonstrate the efficiency and effectiveness of our approach.

关键词： Wireless communication Vehicle-to-grid Systematics Power system management Computational modeling Transforms Relaxation methods

来源：评论

学校读者我要写书评

暂无评论

Knowledge-aware Graph Transformer for Pedestrian Trajectory Prediction

Knowledge-aware Graph Transformer for Pedestrian Trajectory ...

引用

International Conference on Intelligent Transportation

作者： Yu Liu Yuexin Zhang Kunming Li Yongliang Qiao Stewart Worrall You-Fu Li He Kong Shenzhen Key Laboratory of Control Theory and Intelligent Systems Southern University of Science and Technology (SUSTech) Shenzhen China Department of Mechanical Engineering City University of Hong Kong Hong Kong SAR China School of Automation Guangdong Polytechnic Normal University Guangzhou China Australian Centre for Field Robotics The University of Sydney NSW Australia Australian Institute for Machine Learning The University of Adelaide SA Australia Department of Mechanical Engineering City University of Hong Kong Hong Kong SAR China Shenzhen Key Laboratory of Control Theory and Intelligent Systems SUSTech Shenzhen China Guangdong Provincial Key Laboratory of Human-Augmentation Rehabilitation Robotics in Universities SUSTech Shenzhen China

Predicting pedestrian motion trajectories is crucial for path planning and motion control of autonomous vehicles. Accurately forecasting crowd trajectories is challenging due to the uncertain nature of human motions in different environments. For training, recent deep learning-based prediction approaches mainly utilize information like trajectory history and interactions between pedestrians, among others. This can limit the prediction performance across various scenarios since the discrepancies between training datasets have not been properly incorporated. To overcome this limitation, this paper proposes a graph transformer structure to improve prediction performance, capturing the differences between the various sites and scenarios contained in the datasets. In particular, a self-attention mechanism and a domain adaption module have been designed to improve the generalization ability of the model. Moreover, an additional metric considering cross-dataset sequences is introduced for training and performance evaluation purposes. The proposed framework is validated and compared against existing methods using popular public datasets, i.e., ETH and UCY. Experimental results demonstrate the improved performance of our proposed scheme.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：