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

arXiv 2024年

作者： Ding, Yi Tong, Chengxuan Zhang, Shuailei Jiang, Muyun Li, Yong Liang, Kevin Lim Jun Guan, Cuntai College of Computing and Data Science Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Wilmar International Singapore School of Computer Science and Engineering Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Nanjing210096 China

Integrating prior knowledge of neurophysiology into neural network architecture enhances the performance of emotion decoding. While numerous techniques emphasize learning spatial and short-term temporal patterns, there has been limited emphasis on capturing the vital long-term contextual information associated with emotional cognitive processes. In order to address this discrepancy, we introduce a novel transformer model called emotion transformer (EmT). EmT is designed to excel in both generalized cross-subject EEG emotion classification and regression tasks. In EmT, EEG signals are transformed into a temporal graph format, creating a sequence of EEG feature graphs using a temporal graph construction module (TGC). A novel residual multi-view pyramid GCN module (RMPG) is then proposed to learn dynamic graph representations for each EEG feature graph within the series, and the learned representations of each graph are fused into one token. Furthermore, we design a temporal contextual transformer module (TCT) with two types of token mixers to learn the temporal contextual information. Finally, the task-specific output module (TSO) generates the desired outputs. Experiments on four publicly available datasets show that EmT achieves higher results than the baseline methods for both EEG emotion classification and regression tasks. The code is available at https://***/yi-ding-cs/EmT. Copyright © 2024, The Authors. All rights reserved.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

Review of computational neuroaesthetics: bridging the gap between neuroaesthetics and computer science

引用

Brain Informatics 2020年第1期7卷 16页

作者： Li, Rui Zhang, Junsong National Engineering Laboratory for Educational Big Data Central China Normal University WuhanHubei China Fujian Key Laboratory of Brain-Inspired Computing Technique and Applications Department of Artificial Intelligence School of Informatics Xiamen University Xiamen China

The mystery of aesthetics attracts scientists from various research fields. The topic of aesthetics, in combination with other disciplines such as neuroscience and computer science, has brought out the burgeoning fields of neuroaesthetics and computational aesthetics within less than two decades. Despite profound findings are carried out by experimental approaches in neuroaesthetics and by machine learning algorithms in computational neuroaesthetics, these two fields cannot be easily combined to benefit from each other and findings from each field are isolated. Computational neuroaesthetics, which inherits computational approaches from computational aesthetics and experimental approaches from neuroaesthetics, seems to be promising to bridge the gap between neuroaesthetics and computational aesthetics. Here, we review theoretical models and neuroimaging findings about brain activity in neuroaesthetics. Then machine learning algorithms and computational models in computational aesthetics are enumerated. Finally, we introduce studies in computational neuroaesthetics which combine computational models with neuroimaging data to analyze brain connectivity during aesthetic appreciation or give a prediction on aesthetic preference. This paper outlines the rich potential for computational neuroaesthetics to take advantages from both neuroaesthetics and computational aesthetics. We conclude by discussing some of the challenges and potential prospects in computational neuroaesthetics, and highlight issues for future consideration. © 2020, The Author(s).

关键词： Brain

来源：评论

学校读者我要写书评

暂无评论

Ascl: Accelerating Semi-Supervised Learning Via Contrastive Learning

SSRN

引用

SSRN 2024年

作者： Liu, Haixiong Li, Zuoyong Wu, Jiawei Zeng, Kun Hu, Rong Zeng, Wei Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fujian University of Technology Fuzhou350118 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Data Science Minjiang University Fuzhou350121 China School of Intelligent Systems Engineering Shenzhen Campus of Sun Yat-sen University Guangdong Shenzhen518107 China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions Wuyi University Wuyishan354300 China School of Physics and Mechanical and Electrical Engineering Longyan University Longyan364012 China

SSL(Semi-supervised learning) is widely used in machine learning, which leverages labeled and unlabeled data to improve model performance. SSL aims to optimize class mutual information, but noisy pseudo-labels introduce false class information due to the scarcity of labels. Therefore, these algorithms often need significant training time to refine pseudo-labels for performance improvement iteratively. To tackle this challenge, we propose a novel plug-and-play method named ASCL(Accelerating Semi-Supervised Learning via Contrastive Learning). This method combines contrastive learning with uncertainty-based selection for performance improvement and accelerates the convergence of SSL algorithms. Contrastive learning initially emphasizes the mutual information between samples as a means to decrease dependence on pseudo-labels. Subsequently, it gradually turns to maximizing the mutual information between classes, aligning with the objective of semi-supervised learning. Uncertainty-based selection provides a robust mechanism for acquiring pseudo-labels. The combination of the contrastive learning module and the uncertainty-based selection module forms a virtuous cycle to improve the performance of the proposed model. Extensive experiments demonstrate that ASCL outperforms state-of-the-art methods in terms of both convergence efficiency and performance. In the experimental scenario where only one label is assigned per class in the CIFAR-10 dataset, the application of ASCL to Pseudo-label, UDA (Unsupervised data Augmentation for Consistency Training), and Fixmatch benefits substantial improvements in classification accuracy. Specifically, the results demonstrate notable improvements in respect of 16.32%, 6.9%, and 24.43% when compared to the original outcomes. Moreover, the required training time is reduced by almost 50%. © 2024, The Authors. All rights reserved.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

computing optimal partition problems via Lagrange multiplier approach

arXiv

引用

arXiv 2024年

作者： Cheng, Qing Guo, Jing Wang, Dong Department of Mathematics Tongji University Shanghai200092 China Key Laboratory of Intelligent Computing and Applications Tongji University Ministry of Education China School of Science and Engineering The Chinese University of Hong Kong Guangdong Shenzhen518172 China Shenzhen International Center for Industrial and Applied Mathematics Shenzhen Research Institute of Big Data Guangdong518172 China

In this paper, we consider numerical approximations for the optimal partition problem using Lagrange multipliers. By rewriting it into constrained gradient flows, three and four steps numerical schemes based on the Lagrange multiplier approach [16, 17] are proposed to solve the constrained gradient system. Numerical schemes proposed for the constrained gradient flows satisfy the nice properties of orthogonality-preserving, norm-preserving, positivity-preserving and energy dissipating. The proposed schemes are very efficient in which only linear Poisson equations are solved at each time step. Extensive numerical results in 2D and 3D for optimal partition problem are presented to validate the effectiveness and accuracy of the proposed numerical schemes. Copyright © 2024, The Authors. All rights reserved.

关键词： Lagrange multipliers

来源：评论

学校读者我要写书评

暂无评论

Automated classification of textual SPECT diagnostic reports with TextCNN model

Automated classification of textual SPECT diagnostic reports...

引用

2020 International Conference on Communications, Information System and Software Engineering, CISSE 2020

作者： Han, Chengcheng Lin, Qiang Man, Zhengxing Cao, Yongchun Wang, Haijun School of Mathematics and Computer Science Northwest Minzu University No. 1 Xibei Xincun Rd Lanzhou city Gansu Province730030 China Key Laboratory of Streaming Computing and Applications Northwest Minzu University China Department of Nuclear Medicine Gansu Provincial Hospital No. 204 Donggang Xilu Rd. Lanzhou city Gansu Province730000 China

The SPECT diagnostic text contains several aspects of the patient’s personal information, image description, and suggested results. In order to construct a diagnostic model of nuclear medical text, a classification method of nuclear medical text based on deep learning was proposed. TextCNN was applied to propose the classification method of diseases. A set of real nuclear medical text data was used to verify the proposed method, the experimental results show that the proposed method has a good classification effect. © 2021 Journal of Physics: Conference Series.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Constraint Boundary Wandering Framework: Enhancing Constrained Optimization with Deep Neural Networks

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年 PP卷 PP页

作者： Wu, Shuang Chen, Shixiang Shen, Li Zhang, Lefei Tao, Dacheng Wuhan University National Engineering Research Center for Multimedia Software School of Computer Science Wuhan430072 China University of Science and Technology of China Key Laboratory of the Ministry of Education for Mathematical Foundations and Applications of Digital Technology School of Mathematical Sciences China Shenzhen Campus of Sun Yat-sen University School of Cyber Science and Technology Shenzhen518107 China Nanyang Technological University College of Computing and Data Science 639798 Singapore

Constrained optimization problems are pervasive in various fields, and while conventional techniques offer solutions, they often struggle with scalability. Leveraging the power of deep neural networks (DNNs) in optimization, we present a novel learning-based approach, the Constraint Boundary Wandering Framework (CBWF), to address these challenges. Our contributions include introducing a boundary wandering strategy inspired by the active-set method, enhancing equality constraint feasibility, and treating the Lipschitz constant as a learnable parameter. Additionally, we evaluate the regularization term, illustrating that the nonsmooth L2 norm yields superior results. Extensive testing on synthetic datasets and the ACOPT dataset demonstrates CBWF's superiority, outperforming existing deep learning-based solvers in terms of both objective and constraint loss. © 1979-2012 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Predicting Response to Patients with Gastric Cancer Via a Dynamic-Aware Model with Longitudinal Liquid Biopsy data

SSRN

引用

SSRN 2024年

作者： Chen, Zifan Zhao, Jie Li, Yanyan Li, Yilin Liu, Huimin Feng, Xujiao Nan, Xinyu Dong, Bin Shen, Lin Chen, Yang Zhang, Li Center for Data Science Peking University Beijing China Department of Gastrointestinal Oncology Key Laboratory of Carcinogenesis and Translational Research Ministry of Education Peking University Cancer Hospital and Institute Beijing China National Engineering Laboratory for Big Data Analysis and Applications Peking University Beijing China Guangzhou Medical University Guangzhou China Peking University Beijing China Center for Machine Learning Research Peking University Beijing China Peking University Changsha Institute for Computing and Digital Economy Changsha China

Gastric cancer (GC) presents challenges in predicting treatment responses due to its patient-specific heterogeneity. Recently, liquid biopsies have become recognized as a valuable data modality, offering essential cellular and molecular insights and enabling the capture of time-sensitive information. This study aimed to harness artificial intelligence (AI) technology to analyze longitudinal liquid biopsy data. We collected a dataset from longitudinal liquid biopsies of 91 patients at Peking Cancer Hospital, spanning from July 2019 to April 2022, which included 1,895 tumor-related cellular images and 1,698 tumor marker indices. Subsequently, we introduced the Dynamic-Aware Model (DAM) to predict GC treatment responses. DAM incorporates the dynamic data through AI-engineered components, enabling an in-depth longitudinal analysis. Utilizing three-fold cross-validation, DAM exhibited superior performance over traditional cell-counting-based methods, achieving an AUC of 0.807 in predicting GC treatment responses. In the test set, DAM maintained stable efficacy with an AUC of 0.802. Besides, DAM showed the capability to accurately predict treatment responses from early treatment data. Moreover, DAM's visual analysis of attention mechanisms identified six dynamic focus-area-related visual features and their strong association with treatment response. These findings represent a pioneering effort in applying AI technology for interpreting longitudinal liquid biopsy data and employ visual analytics in GC, offering a promising avenue toward precise response prediction and tailored treatment strategies for patients with ***: This work was supported by the National Natural Science Foundation of China (81801778 to Li Zhang., 82203881 to Yang Chen, U22A20327 to Lin Shen, 12090022 to Bin Dong), Beijing Natural Science Foundation (7222021 to Yang Chen), Beijing Hospitals Authority Youth Programme (QML20231115 to Yang Chen), Clinical Medicine Plus X-Young Scholars Project of P

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

A TSP-over-LEACH Protocol for Energy-Efficient Wireless Sensor Networks

Journal of Network Intelligence

引用

Journal of Network Intelligence 2021年第4期6卷 835-846页

作者： Hsieh, Chaur-Heh Lin, Jianping Yu, Chih-Min Hung, Mao-Hsiung Huang, Fenghua Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology No.33 Xuefunan Road University Town Minhou Fuzhou350118 China College of Artificial Intelligence Yango University Fuzhou350015 China School of Computer Science and Mathematics Fujian University of Technology Fuzhou350118 China College of Computing and Informatics University of North Carolina at Charlotte CharlotteNC28223 United States

Wireless sensor networks (WSNs) play as a way that associates the cy-bernetic digital world to the actual world. The clustering concept in WSNs can effectively prevent the unnecessary energy consumption in delivering packets to the sink by dividing the network into several groups or clusters. In LEACH protocol, cluster heads (CHs) among different clusters can aggregate sensed data and directly dispatch packets via single-hop transmission to the data sink. Hence, a new challenging issue is generated to reduce the energy consumption for all CHs transmissions since the multi-hop transmission among CHs can effectively reduce the total transmission distance than the direct transmission of CHs in the conventional LEACH. In this paper, a travelling sales-man protocol (TSP) over LEACH (TSP-over-LEACH) is proposed based on the existing LEACH to minimize the total transmission distance among CHs and reduces the total power consumption of all CHs. The operation of TSP-over LEACH is divided into two stages. In the first stage, several CHs are determined randomly as the LEACH proto-col. In the second stage, a shortest routing path is established for packet transmission along all CHs and the data sink to reduce the total transmission distance. As a result, the TSP-over-LEACH can calculate the minimum hop and distance to achieve the minimiza-tion of total energy consumption of all CHs. Simulation results show that the proposed TSP-over-LEACH can effectively reduce total energy consumption as the number of CHs increases especially when the sink node is far away and outside the operation area. keywords:. © 2021, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

On function spaces related to H-sober spaces

arXiv

引用

arXiv 2022年

作者： Bao, Meng Zhang, Xiaoyuan Xu, Xiaoquan College of Mathematics Sichuan University Chengdu610064 China School of Big Data Science Hebei Finance University Baoding071051 China Fujian Key Laboratory of Granular Computing and Applications Minnan Normal University Zhangzhou363000 China

In this paper, we mainly study the function spaces related to H-sober spaces. For an irreducible subset system H and T0 spaces X and Y, it is proved that Y is H-sober iff the function space C(X, Y ) of all continuous functions f : X −→ Y equipped with the topology of pointwise convergence is H-sober iff the function space C(X, Y ) equipped with the Isbell topology is H-sober. One immediate corollary is that for a T0 space X, Y is a sober space (resp., d-space, well-filtered space) iff the function space C(X, Y ) equipped with the topology of pointwise convergence is a sober space (resp., d-space, well-filtered space) iff the function space C(X, Y ) equipped with the the Isbell topology is a sober space (resp., d-space, well-filtered space). It is shown that T0 spaces X and Y, if the function space C(X, Y ) equipped with the compact-open topology is H-sober, then Y is H-sober. The function space C(X, Y ) equipped with the Scott topology is also *** Codes 54C35, 54D99, 06B30, 06B35 © 2022, CC BY.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

On Star Coloring of Mycielski's Graphs for Special Graphs

On Star Coloring of Mycielski's Graphs for Special Graphs

引用

Computer Science and Management Technology (ICCSMT), International Conference on

作者： Cai Jin Shuangliang Tian Zhuomo An School of Mathematics and Computer Science Northwest for Minzu University Key Laboratory of Streaming Data Computing Technologies and Applications Northwest Minzu University Lanzhou China

ISBN: (纸本)9781728186696

Let G be a simple graph with vertex set V (G) and edge set E (G). A vertex coloring of G is called a star coloring of G if any path of 4 order is bicolored. The minimum number of colors required for a star coloring of G is denoted by χ s (G). Let G is a simple graph with vertex set V (G) = V and edge set E (G) = E, if the vertex set is V ∪ V' ∪ {w} where V' = {X' : x ∈ V} and the edge set is EU{xy' : xy∈V} U {y'w : y'∈V'}, then G is a Mycielski's graph. This paper mainly studies star coloring of Mycielski's graph for some special graphs, the specific results are as follows: if n = 2,3 , then χ s (M (P n )) = 4, otherwise, χ s (M (P n )) = 6 ; if n = 5, then χ s (M(C n )) = 8, otherwise, χ s (M(C n )) = 6 ; χ s (M(S n )) = 4 ; χ s (M (K n )) = n + 2.

关键词： Computer science Color

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：