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

A biosensing system using a multiparameter nonlinear dynamic analysis of cardiomyocyte beating for drug-induced arrhythmia recognition

引用

Microsystems & Nanoengineering 2022年第3期8卷 277-290页

作者： Hao Wang Yue Wu Quchao Zou Wenjian Yang Zhongyuan Xu Hao Dong Zhjing Zhu Depeng Wang Tanxing Wang Ning Hu Diming Zhang State Key Laboratory of Optoelectronic Materials and Technologies Guangdong Province Key Laboratory of Display Material and TechnologySchool of Electronics and Information TechnologySun Yat-sen UniversityGuangzhou 510006China Research Center for Itelligent Sensing Systems Zhejiang LabHangzhou 311121China ZJU-Hangzhou Global Scientific and Technological Innovation Center Department of ChemistryThe Second Affiliated Hospital Zhejiang University School of MedicineDepartment of Clinical Medical EngineeringZhejiang UniversityHangzhou 310058China Key Laboratory of Novel Target and Drug Study for Neural Repair of Zhejang Province School of MedicineSchool of Computer&Computing ScienceZhejiang University City CollegeHangzhou 310015China School of Brain Science and Brain Medicine Zhejiang UniversityHangzhou 310058China College of Energy and Power Engineering Nanjing University of Aeronautics and AstronauticsNanjing 210016China E-LinkCare Meditech Co LtdHangzhou 310011China State Key Laboratory of Transducer Technology Chinese Academy of SciencesShanghai 200050China

Cardiovascular disease is the number one cause of death in ***,cardiotoxicity is one of the most important adverse effects assessed by arrhythmia recognition in drug ***,cell-based techniques developed for arhythmia recognition primarily employ linear methods such as time-domain analysis that detect and compare individual waveforms and thus fall short in some applications that require automated and efficient arrhythmia recognition from large *** carried out the frst report to develop a biosensing system that integrated impedance measurement and multiparameter nonlinear dynamic algorithm(MNDA)analysis for druginduced arrhythmia recognition and *** biosensing system cultured cardiomyocytes as physiologically relevant models,used interdigitated electrodes to detect the mechanical beating of the cardiomyocytes,and employed MNDA analysis to recognize drug-induced arrhythmia from the cardiomyocyte beating *** best performing MNDA parameter,approximate entropy,enabled the system to recognize the appearance of sertindoleand norepinephrine-induced arrhythmia in the *** MNDA reconstruction in phase space enabled the system to classify the different arrhythmias and quantify the severity of *** new biosensing system utilizing MNDA provides a promising and alternative method for drug-induced arrhythmia recognition and classification in cardiological and pharmaceutical applications.

关键词： arrhythmia cardio analysis

来源：评论

学校读者我要写书评

暂无评论

Newton-cotes graph neural networks: on the time evolution of dynamic systems 23

Newton-cotes graph neural networks: on the time evolution of...

引用

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Lingbing Guo Weiqing Wang Zhuo Chen Ningyu Zhang Zequn Sun Yixuan Lai Qiang Zhang Huajun Chen College of Computer Science and Technology Zhejiang University and Zhejiang University - Ant Group Joint Laboratory of Knowledge Graph and ZJU-Hangzhou Global Scientific and Technological Innovation Center Department of Data Science & AI Monash University College of Computer Science and Technology Zhejiang University and Zhejiang University - Ant Group Joint Laboratory of Knowledge Graph State Key Laboratory for Novel Software Technology Nanjing University College of Computer Science and Technology Zhejiang University and ZJU-Hangzhou Global Scientific and Technological Innovation Center

Reasoning system dynamics is one of the most important analytical approaches for many scientific studies. With the initial state of a system as input, the recent graph neural networks (GNNs)-based methods are capable of predicting the future state distant in time with high accuracy. Although these methods have diverse designs in modeling the coordinates and interacting forces of the system, we show that they actually share a common paradigm that learns the integration of the velocity over the interval between the initial and terminal coordinates. However, their integrand is constant w.r.t. time. Inspired by this observation, we propose a new approach to predict the integration based on several velocity estimations with Newton-Cotes formulas and prove its effectiveness theoretically. Extensive experiments on several benchmarks empirically demonstrate consistent and significant improvement compared with the state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Robust Method for Tdoa-Based Localization and Tracking in Real Indoor Environment

SSRN

引用

SSRN 2022年

作者： Mei, Hong-Yuan Zhou, Zhi Shen, Fu-Rao Zhao, Jian School of Artificial Intelligence Nanjing University China State Key Laboratory for Novel Software Technology Nanjing China Department of Computer Science and Technology Nanjing University China School of Electronic Science and Engineering Nanjing University China

Great efforts have been made to deal with localization based on time-difference-of-arrival (TDOA) measurements in the past decades. It is widely used in applications such as radar, sonar, sensor networks, and mobile communications. However, such a task is still challenging in complex real-world scenarios where large-scale noise and none-light-of-sight (NLOS) occur. To address this challenge, we propose a noise-tolerant method consisting of two stages: Robust Multilateration Solver (RMS) and Restricted Particle Filter (RPF). In the first stage, anomaly detection is adopted to eliminate outliers and NLOS effects are mitigated by a data augmentation strategy. Then a rough estimate of the current position is obtained by a combination of two modified multilateration algorithms. In the second stage, the rough estimate is passed through an enhanced particle filter in order to reduce its bias caused by heavy Gaussian noise and smooth the motion trajectory. Meanwhile, the localization rationality is guaranteed by confining the position to a predefined area. Sufficient testing in real indoor environments and simulation results demonstrate the effectiveness of our method, revealing its fitness for various industrial fields. © 2022, The Authors. All rights reserved.

关键词： Time difference of arrival

来源：评论

学校读者我要写书评

暂无评论

Learning the Relation between Similarity Loss and Clustering Loss in Self-Supervised Learning

arXiv

引用

arXiv 2023年

作者： Ge, Jidong Liu, Yuxiang Gui, Jie Fang, Lanting Lin, Ming Kwok, James Tin-Yau Huang, LiGuo Luo, Bin State Key Laboratory for Novel Software Technology Software Institute Nanjing University Nanjing210093 China The School of Cyber Science and Engineering Southeast University Purple Mountain Laboratories Nanjing210000 China *** L.L.C. United States Alibaba Group China The Department of Computer Science and Engineering The Hong Kong University of Science and Technology 999077 Hong Kong The Department of Computer Science Southern Methodist University DallasTX75205 United States

Self-supervised learning enables networks to learn discriminative features from massive data itself. Most state-of-the-art methods maximize the similarity between two augmentations of one image based on contrastive learning. By utilizing the consistency of two augmentations, the burden of manual annotations can be freed. Contrastive learning exploits instance-level information to learn robust features. However, the learned information is probably confined to different views of the same instance. In this paper, we attempt to leverage the similarity between two distinct images to boost representation in self-supervised learning. In contrast to instance-level information, the similarity between two distinct images may provide more useful information. Besides, we analyze the relation between similarity loss and feature-level cross-entropy loss. These two losses are essential for most deep learning methods. However, the relation between these two losses is not clear. Similarity loss helps obtain instance-level representation, while feature-level cross-entropy loss helps mine the similarity between two distinct images. We provide theoretical analyses and experiments to show that a suitable combination of these two losses can get state-of-the-art results. Code is available at https://***/guijiejie/ICCL. Copyright © 2023, The Authors. All rights reserved.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Towards Task Sampler Learning for Meta-Learning

arXiv

引用

arXiv 2023年

作者： Wang, Jingyao Qiang, Wenwen Su, Xingzhe Zheng, Changwen Sun, Fuchun Xiong, Hui National Key Laboratory of Space Integrated Information System Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Department of Computer Science and Technology Tsinghua University Beijing China Thrust of Artificial Intelligence Hong Kong University of Science and Technology Guangzhou China Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong

Meta-learning aims to learn general knowledge with diverse training tasks conducted from limited data, and then transfer it to new tasks. It is commonly believed that increasing task diversity will enhance the generalization ability of meta-learning models. However, this paper challenges this view through empirical and theoretical analysis. We obtain three conclusions: (i) there is no universal task sampling strategy that can guarantee the optimal performance of meta-learning models;(ii) over-constraining task diversity may incur the risk of under-fitting or overfitting during training;and (iii) the generalization performance of meta-learning models are affected by task diversity, task entropy, and task difficulty. Based on this insight, we design a novel task sampler, called Adaptive Sampler (ASr). ASr is a plug-and-play module that can be integrated into any meta-learning framework. It dynamically adjusts task weights according to task diversity, task entropy, and task difficulty, thereby obtaining the optimal probability distribution for meta-training tasks. Finally, we conduct experiments on a series of benchmark datasets across various scenarios, and the results demonstrate that ASr has clear advantages. The code is publicly available at https://***/WangJingyao07/AdaptiveSampler. Copyright © 2023, The Authors. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

HeGTa: Leveraging Heterogeneous Graph-enhanced Large Language Models for Few-shot Complex Table Understanding

arXiv

引用

arXiv 2024年

作者： Jin, Rihui Li, Yu Qi, Guilin Hu, Nan Li, Yuan-Fang Chen, Jiaoyan Wang, Jianan Chen, Yongrui Min, Dehai Bi, Sheng School of Computer Science and Engineering Southeast University China Key Laboratory of New Generation Artificial Intelligence Technology and its Interdisciplinary Applications Southeast University Ministry of Education China Monash University Australia The University of Manchester United Kingdom Alibaba Group China Law and Innovation Lab Law School Southeast University China State Key Laboratory for Novel Software Technology Nanjing University China

Table Understanding (TU) has achieved promising advancements, but it faces the challenges of the scarcity of manually labeled tables and the presence of complex table structures. To address these challenges, we propose HeGTa, a heterogeneous graph (HG)-enhanced large language model (LLM) designed for few-shot TU tasks. This framework aligns structural table semantics with the LLM’s parametric knowledge through soft prompts and instruction tuning. It also addresses complex tables with a multi-task pre-training scheme by incorporating novel multi-granularity self-supervised HG pretext tasks. We empirically demonstrate the effectiveness of HeGTa, showing that it outperforms the SOTA for few-shot complex TU on several benchmarks. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

EEG based Emotion Recognition: A Tutorial and Review

arXiv

引用

arXiv 2022年

作者： Li, Xiang Zhang, Yazhou Tiwari, Prayag Song, Dawei Hu, Bin Yang, Meihong Zhao, Zhigang Kumar, Neeraj Marttinen, Pekka Qilu University of Technology Shandong Academy of Sciences Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China Software Engineering College Zhengzhou University of Light Industry Zhengzhou China State Key Lab. for Novel Software Technology Nanjing University Nanjing China Department of Computer Science Aalto University Finland School of Computer Science and Technology Beijing Institute of Technology Beijing China Institute of Engineering Medicine Beijing Institute of Technology Beijing China Department of Computer Science and Engineering Thapar Institute of Engineering and Technology Deemed University Punjab Patiala India

Emotion recognition technology through analyzing the EEG signal is currently an essential concept in Artificial Intelligence and holds great potential in emotional health care, human-computer interaction, multimedia content recommendation, etc. Though there have been several works devoted to reviewing EEG-based emotion recognition, the content of these reviews needs to be updated. In addition, those works are either fragmented in content or only focus on specific techniques adopted in this area but neglect the holistic perspective of the entire technical routes. Hence, in this paper, we review from the perspective of researchers who try to take the first step on this topic. We review the recent representative works in the EEG-based emotion recognition research and provide a tutorial to guide the researchers to start from the beginning. The scientific basis of EEG-based emotion recognition in the psychological and physiological levels is introduced. Further, we categorize these reviewed works into different technical routes and illustrate the theoretical basis and the research motivation, which will help the readers better understand why those techniques are studied and employed. At last, existing challenges and future investigations are also discussed in this paper, which guides the researchers to decide potential future research directions. Copyright © 2022, The Authors. All rights reserved.

关键词： Speech recognition

来源：评论

学校读者我要写书评

暂无评论

Detecting Backdoors During the Inference Stage Based on Corruption Robustness Consistency

Detecting Backdoors During the Inference Stage Based on Corr...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Xiaogeng Liu Minghui Li Haoyu Wang Shengshan Hu Dengpan Ye Hai Jin Libing Wu Chaowei Xiao School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Software Engineering Huazhong University of Science and Technology School of Cyber Science and Engineering Wuhan University School of Computer Science and Technology Huazhong University of Science and Technology Cluster and Grid Computing Lab Arizona State University

Deep neural networks are proven to be vulnerable to backdoor attacks. Detecting the trigger samples during the inference stage, i.e., the test-time trigger sample detection, can prevent the backdoor from being triggered. However, existing detection methods often require the defenders to have high accessibility to victim models, extra clean data, or knowledge about the appearance of backdoor triggers, limiting their practicality. In this paper, we propose the test-time corruption robustness consistency evaluation (TeCo) 1 1 https://***/CGCL-codes/TeCo, a novel test-time trigger sample detection method that only needs the hard-label outputs of the victim models without any extra information. Our journey begins with the intriguing observation that the backdoor-infected models have similar performance across different image corruptions for the clean images, but perform discrepantly for the trigger samples. Based on this phenomenon, we design TeCo to evaluate test-time robustness consistency by calculating the deviation of severity that leads to predictions' transition across different corruptions. Extensive experiments demonstrate that compared with state-of-the-art defenses, which even require either certain information about the trigger types or accessibility of clean data, TeCo outperforms them on different backdoor attacks, datasets, and model architectures, enjoying a higher AUROC by 10% and 5 times of stability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Attention-Based Knowledge-aware Multi-Interest Intelligent Model for Sequential Recommendation

Attention-Based Knowledge-aware Multi-Interest Intelligent M...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, UIC-ATC

作者： Yang Li Qianmu Li Shunmei Meng Jun Hou School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China Intelligent Manufacturing Department Wuyi University Jiangmen China State Key Lab. for Novel Software Technology Nanjing University Nanjing China School of Social Science Nanjing Vocational University of Industry Technology Nanjing China

As a fundamental means of intelligent service, recommender systems have shown a trend of diversification. Sequential recommendation, a class of time-aware methods, aims to predict the user’s next click. Multi-interest representation is a hot topic in recommender systems, but the research on how to apply multi-interest into sequences is still in the minority. And many methods will introduce knowledge graph to improve the representation of items, but how to consider both knowledge graph and user’s multi-interest in sequential recommendation has become a temporary blank. In this paper, we propose an attentive sequential recommendation with knowledge-aware multi-interest module (AKAMI). Items are embedded from the sequence’s structure and user’s interests. Specifically, we represent items by stacking self-attention layers to mine the internal correlation of the sequence. Meanwhile, we segment the sequence via the common neighbors in the knowledge graph and cast the user’s multi-interest based on the aggregation of subsequences. Multi-interests are integrated into item representation by the gating network adaptively. Comprehensive experiments on two real-world datasets show that the proposed model performs better than various representative methods under different evaluation metrics. Additionally, we also visually explain the model through a case study.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Your Transformer May Not be as Powerful as You Expect 36

Your Transformer May Not be as Powerful as You Expect

引用

36th Conference on Neural Information Processing Systems, NeurIPS 2022

作者： Luo, Shengjie Li, Shanda Zheng, Shuxin Liu, Tie-Yan Wang, Liwei He, Di National Key Laboratory of General Artificial Intelligence School of Intelligence Science and Technology Peking University China Machine Learning Department School of Computer Science Carnegie Mellon University United States Microsoft Research United States Center for Data Science Peking University China Zhejiang Lab China

ISBN: (纸本)9781713871088

Relative Positional Encoding (RPE), which encodes the relative distance between any pair of tokens, is one of the most successful modifications to the original Transformer. As far as we know, theoretical understanding of the RPE-based Transformers is largely unexplored. In this work, we mathematically analyze the power of RPE-based Transformers regarding whether the model is capable of approximating any continuous sequence-to-sequence functions. One may naturally assume the answer is in the affirmative-RPE-based Transformers are universal function approximators. However, we present a negative result by showing there exist continuous sequence-to-sequence functions that RPE-based Transformers cannot approximate no matter how deep and wide the neural network is. One key reason lies in that most RPEs are placed in the softmax attention that always generates a right stochastic matrix. This restricts the network from capturing positional information in the RPEs and limits its capacity. To overcome the problem and make the model more powerful, we first present sufficient conditions for RPE-based Transformers to achieve universal function approximation. With the theoretical guidance, we develop a novel attention module, called Universal RPE-based (URPE) Attention, which satisfies the conditions. Therefore, the corresponding URPE-based Transformers become universal function approximators. Extensive experiments covering typical architectures and tasks demonstrate that our model is parameter-efficient and can achieve superior performance to strong baselines in a wide range of applications. The code will be made publicly available at https://***/lsj2408/URPE. © 2022 Neural information processing systems foundation. All rights reserved.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：