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

arXiv 2021年

作者： Wu, Xuan Han, Jizong Wang, Di Gao, Pengyue Cui, Quanlong Chen, Liang Liang, Yanchun Huang, Han Lee, Heow Pueh Miao, Chunyan Zhou, You Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore State Key Laboratory of Superhard Materials International Center for Computational Method and Software College of Physics Jilin University Changchun130012 China Commercial Quality and Efficiency Department Baidu Inc Beijing100085 China Department of Computer Science Shantou University Shantou515063 China School of Computer Science Zhuhai College of Science and Technology Zhuhai519041 China School of Software Engineering The South China University of Technology Guangzhou510641 China Department of Mechanical Engineering National University of Singapore 117575 Singapore School of Computer Science and Engineering Nanyang Technological University 639798 Singapore College of Software Jilin University Changchun130012 China

While many Particle Swarm Optimization (PSO) algorithms only use fitness to assess the performance of particles, in this work, we adopt Surprisingly Popular Algorithm (SPA) as a complementary metric in addition to fitness. Consequently, particles that are not widely known also have the opportunity to be selected as the learning exemplars. In addition, we propose a Euclidean distance-based adaptive topology to cooperate with SPA, where each particle only connects to k number of particles with the shortest Euclidean distance during each iteration. We also introduce the adaptive topology into heterogeneous populations to better solve large-scale problems. Specifically, the exploration sub-population better preserves the diversity of the population while the exploitation sub-population achieves fast convergence. Therefore, large-scale problems can be solved in a collaborative manner to elevate the overall performance. To evaluate the performance of our method, we conduct extensive experiments on various optimization problems, including three benchmark suites and two real-world optimization problems. The results demonstrate that our Euclidean distance-based adaptive topology outperforms the other widely adopted topologies and further suggest that our method performs significantly better than state-of-the-art PSO variants on small, medium, and large-scale problems. Copyright © 2021, The Authors. All rights reserved.

关键词： Small-world networks

来源：评论

学校读者我要写书评

暂无评论

Aerial Active STAR-RIS-assisted Satellite-Terrestrial Covert Communications

arXiv

引用

arXiv 2025年

作者： Zhang, Chuang Sun, Geng Li, Jiahui Wang, Jiacheng Zhang, Ruichen Niyato, Dusit Mao, Shiwen Quek, Tony Q.S. Computer Science and Technology Jilin University Changchun130012 China Singapore University of Technology and Design Singapore487372 Singapore College of Computer Science and Technology Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849 United States Information System Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore

An integration of satellites and terrestrial networks is crucial for enhancing performance of next generation communication systems. However, the networks are hindered by the long-distance path loss and security risks in dense urban environments. In this work, we propose a satellite-terrestrial covert communication system assisted by the aerial active simultaneous transmitting and reflecting reconfigurable intelligent surface (AASTAR-RIS) to improve the channel capacity while ensuring the transmission covertness. Specifically, we first derive the minimal detection error probability (DEP) under the worst condition that the Warden has perfect channel state information (CSI). Then, we formulate an AASTAR-RIS-assisted satellite-terrestrial covert communication optimization problem (ASCCOP) to maximize the sum of the fair channel capacity for all ground users while meeting the strict covert constraint, by jointly optimizing the trajectory and active beamforming of the AASTAR-RIS. Due to the challenges posed by the complex and high-dimensional state-action spaces as well as the need for efficient exploration in dynamic environments, we propose a generative deterministic policy gradient (GDPG) algorithm, which is a generative deep reinforcement learning (DRL) method to solve the ASCCOP. Concretely, the generative diffusion model (GDM) is utilized as the policy representation of the algorithm to enhance the exploration process by generating diverse and high-quality samples through a series of denoising steps. Moreover, we incorporate an action gradient mechanism to accomplish the policy improvement of the algorithm, which refines the better state-action pairs through the gradient ascent. Simulation results demonstrate that the proposed approach significantly outperforms important benchmarks, and also validate the performance and practicality under different algorithm parameters and environment settings. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

AMPCliff: Quantitative definition and benchmarking of activity cliffs in antimicrobial peptides

引用

Journal of Advanced Research 2025年

作者： Li, Kewei Wu, Yuqian Li, Yinheng Guo, Yutong Kong, Yanwen Wang, Yan Liang, Yiyang Fan, Yusi Huang, Lan Zhang, Ruochi Zhou, Fengfeng College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun 130012 China School of Software Jilin University Jilin Changchun 130012 China School of Life Sciences Jilin University Jilin Changchun 130012 China Department of Computer Science Columbia University 116th and Broadway New York City 10027 NY United States School of Artificial Intelligence Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun 130012 China School of Biology and Engineering Guizhou Medical University Guizhou Guiyang 550025 China School of Computer Engineering Changchun University of Engineering Jilin Changchun 130103 China Changchun Wenli High School Jilin Changchun 130062 China

Introduction: Activity cliff (AC) is a phenomenon that a pair of similar molecules differ by a small structural alternation but exhibit a large difference in their biochemical activities. This phenomenon affects various tasks ranging from virtual screening to lead optimization in drug development. The AC of small molecules has been extensively investigated but limited knowledge is accumulated about the AC phenomenon in pharmaceutical peptides with canonical amino acids. Objectives: This study introduces a quantitative definition and benchmarking framework AMPCliff for the AC phenomenon in antimicrobial peptides (AMPs) composed by canonical amino acids. Methods: This study establishes a benchmark dataset of paired AMPs in Staphylococcus aureus from the publicly available AMP dataset GRAMPA, and conducts a rigorous procedure to evaluate various AMP AC prediction models, including nine machine learning, four deep learning algorithms, four masked language models, and four generative language models. Results: A comprehensive analysis of the existing AMP dataset reveals a significant prevalence of AC within AMPs. AMPCliff quantifies the activities of AMPs by the metric minimum inhibitory concentration (MIC), and defines 0.9 as the minimum threshold for the normalized BLOSUM62 similarity score between a pair of aligned peptides with at least two-fold MIC changes. Our analysis reveals that these models are capable of detecting AMP AC events and the pre-trained protein language model ESM2 demonstrates superior performance across the evaluations. The predictive performance of AMP activity cliffs remains to be further improved, considering that ESM2 with 33 layers only achieves the Spearman correlation coefficient 0.4669 for the regression task of the −log(MIC) values on the benchmark dataset. Conclusion: Our findings highlight limitations in current deep learning-based representation models. To more accurately capture the properties of antimicrobial peptides (AMPs), it is ess

关键词： Activity cliff (AC) AMPCliff Antimicrobial peptide (AMP) Benchmark Minimum inhibitory concentration (MIC)

来源：评论

学校读者我要写书评

暂无评论

An AO-ADMM approach to constraining PARAFAC2 on all modes

arXiv

引用

arXiv 2021年

作者： Roald, Marie Schenker, Carla Calhoun, Vince D. Adalı, Tülay Bro, Rasmus Cohen, Jeremy E. Acar, Evrim Department of Data Science and Knowledge Discovery Simula Metropolitan Center for Digital Engineering Oslo Norway Faculty of Technology Art and Design Oslo Metropolitan University Oslo Norway Department of Psychology Georgia State University AtlantaGA United States Department of Computer Science and Electrical Engineering UMBC BaltimoreMD United States Department of Food Science University of Copenhagen Copenhagen Denmark Univ Lyon INSA-Lyon UCBL UJM-Saint Etienne CNRS Inserm CREATIS UMR 5220 U1206 VilleurbanneF-69100 France

Analyzing multi-way measurements with variations across one mode of the dataset is a challenge in various fields including data mining, neuroscience and chemometrics. For example, measurements may evolve over time or have unaligned time profiles. The PARAFAC2 model has been successfully used to analyze such data by allowing the underlying factor matrices in one mode (i.e., the evolving mode) to change across slices. The traditional approach to fit a PARAFAC2 model is to use an alternating least squares-based algorithm, which handles the constant cross-product constraint of the PARAFAC2 model by implicitly estimating the evolving factor matrices. This approach makes imposing regularization on these factor matrices challenging. There is currently no algorithm to flexibly impose such regularization with general penalty functions and hard constraints. In order to address this challenge and to avoid the implicit estimation, in this paper, we propose an algorithm for fitting PARAFAC2 based on alternating optimization with the alternating direction method of multipliers (AO-ADMM). With numerical experiments on simulated data, we show that the proposed PARAFAC2 AO-ADMM approach allows for flexible constraints, recovers the underlying patterns accurately, and is computationally efficient compared to the state-of-the-art. We also apply our model to two real-world datasets from neuroscience and chemometrics, and show that constraining the evolving mode improves the interpretability of the extracted *** Codes 15A69, 90C26 © 2021, CC BY.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Senzi: A sentiment analysis lexicon for the latinised Arabic (Arabizi) 12

Senzi: A sentiment analysis lexicon for the latinised Arabic...

引用

12th International Conference on Recent Advances in Natural Language Processing, RANLP 2019

作者： Tobaili, Taha Fernandez, Miriam Alani, Harith Sharafeddine, Sanaa Hajj, Hazem Glavaš, Goran Knowledge Media Institute Open University United Kingdom Department of Computer Science and Mathematics Lebanese American University Lebanon Department of Electrical and Computer Engineering American University of Beirut Lebanon Data and Web Science Group Universität Mannheim Germany

ISBN: (纸本)9789544520557

Arabizi is an informal written form of dialectal Arabic transcribed in Latin alphanumeric characters. It has a proven popularity on chat platforms and social media, yet it suffers from a severe lack of natural language processing (NLP) resources. As such, texts written in Arabizi are often disregarded in sentiment analysis tasks for Arabic. In this paper we describe the creation of a sentiment lexicon for Arabizi that was enriched with word embeddings. The result is a new Arabizi lexicon consisting of 11.3K positive and 13.3K negative words. We evaluated this lexicon by classifying the sentiment of Arabizi tweets achieving an F1-score of 0.72. We provide a detailed error analysis to present the challenges that impact the sentiment analysis of Arabizi. © 2019 Association for Computational Linguistics (ACL). All rights reserved.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

VAE-GAN based zero-shot outlier detection 4

VAE-GAN based zero-shot outlier detection

引用

4th International Symposium on computer science and Intelligent Control, ISCSIC 2020

作者： Ibrahim, Bekkouch Imad Nicolae, Dragos Constantin Khan, Adil Ali, Syed Imran Khattak, Asad Machine Learning and Knowledge Representation Lab Institute of Data Science and AI Innopolis Tatarstan Russia Institutul de Cercetari Pentru Inteligenta Artificiala Mihai Draganescu Romania Department of Computer Engineering Kyung Hee University Yongin-si Korea Republic of College of Technological Innovations Zayed University Abu Dhabi United Arab Emirates

ISBN: (纸本)9781450388894

Outlier detection is one of the main fields in machine learning and it has been growing rapidly due to its wide range of applications. In the last few years, deep learning-based methods have outperformed machine learning and handcrafted outlier detection techniques, and our method is no different. We present a new twist to generative models which leverages variational autoencoders as a source for uniform distributions which can be used to separate the inliers from the outliers. Both the generative and adversarial parts of the model are used to obtain three main losses (Reconstruction loss, KL-divergence, Discriminative loss) which in return are wrapped with a one-class SVM which is used to make the predictions. We evaluated our method against several datasets both for images and tabular data and it has shown great results for the zero-shot outlier detection problem and was able to easily generalize it for supervised outlier detection tasks on which the performance has increased. For comparison, we evaluated our method against several of the common outlier detection techniques such as DBSCAN-based outlier detection, GMM, K-means and one class SVM directly, and we have outperformed all of them on all datasets. © 2020 ACM.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Urban traffic dynamic rerouting framework: a DRL-based model with fog-cloud architecture

arXiv

引用

arXiv 2021年

作者： Du, Runjia Chen, Sikai Dong, Jiqian Chen, Tiantian Fu, Xiaowen Labi, Samuel Lyles School of Civil Engineering Purdue University West LafayetteIN47907 United States Robotics Institute School of Computer Science Carnegie Mellon University PittsburghPA15213 United States Knowledge Management and Innovation Research Centre Department of Industrial and System Engineering Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong

Past research and practice have demonstrated that dynamic rerouting framework is effective in mitigating urban traffic congestion and thereby improve urban travel efficiency. It has been suggested that dynamic rerouting could be facilitated using emerging technologies such as fog-computing which offer advantages of low-latency capabilities and information exchange between vehicles and roadway infrastructure. To address this question, this study proposes a two-stage model that combines GAQ (Graph Attention Network – Deep Q Learning) and EBkSP (Entropy Based k Shortest Path) using a fog-cloud architecture, to reroute vehicles in a dynamic urban environment and therefore to improve travel efficiency in terms of travel speed. First, GAQ analyzes the traffic conditions on each road and for each fog area, and then assigns a road index based on the information attention from both local and neighboring areas. Second, EBkSP assigns the route for each vehicle based on the vehicle priority (vehicle’s proximity to intended destination) and route popularity (route’s frequency of patronage). A case study experiment is carried out to investigate the efficacy of the proposed model. At the experiment’s model training stage, different methods are used to establish the vehicle priorities, and their impact on the results is assessed. Also, the proposed model is tested under various scenarios with different ratios of rerouting and background (non-rerouting) vehicles. The results demonstrate that vehicle rerouting using the proposed model can help attain higher speed and reduces possibility of severe congestion. This result suggests that the proposed model can be deployed by urban transportation agencies for dynamic rerouting and ultimately, to reduce urban traffic congestion. Copyright © 2021, The Authors. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

GEOM-GCN: Geometric graph convolutional networks

arXiv

引用

arXiv 2020年

作者： Pei, Hongbin Wei, Bingzhe Chang, Kevin Chen-Chuan Lei, Yu Yang, Bo College of Computer Science and Technology Jilin University China Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign United States Department of Computer Science University of Illinois at Urbana-Champaign United States Department of Computing Hong Kong Polytechnic University Hong Kong Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education China

Message-passing neural networks (MPNNs) have been successfully applied to representation learning on graphs in a variety of real-world applications. However, two fundamental weaknesses of MPNNs' aggregators limit their ability to represent graph-structured data: losing the structural information of nodes in neighborhoods and lacking the ability to capture long-range dependencies in disassortative graphs. Few studies have noticed the weaknesses from different perspectives. From the observations on classical neural network and network geometry, we propose a novel geometric aggregation scheme for graph neural networks to overcome the two weaknesses. The behind basic idea is the aggregation on a graph can benefit from a continuous space underlying the graph. The proposed aggregation scheme is permutation-invariant and consists of three modules, node embedding, structural neighborhood, and bi-level aggregation. We also present an implementation of the scheme in graph convolutional networks, termed Geom-GCN, to perform transductive learning on graphs. Experimental results show the proposed Geom-GCN achieved state-of-the-art performance on a wide range of open datasets of graphs. Copyright © 2020, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Preface

Communications in Computer and Information Science

引用

Communications in computer and Information science 2024年 2008卷 v-vi页

作者： Dhar, Suparna Goswami, Sanjay Dinesh Kumar, U. Bose, Indranil Dubey, Rameshwar Mazumdar, Chandan NSHM Institute of Computing & Analytics NSHM Knowledge Campus Kolkata Kolkata India NSHM Knowledge Campus Kolkata India Indian Institute of Management Bangalore Bengaluru India Indian Institute of Management Ahmedabad Gujarat Ahmedabad India Liverpool Business School Liverpool John Moores University Liverpool United Kingdom Department of Computer Science and Engineering Jadavpur University West Bengal Kolkata India

来源：评论

学校读者我要写书评

暂无评论

StRegA: Unsupervised Anomaly Detection in Brain MRIs using a Compact Context-encoding Variational Autoencoder

arXiv

引用

arXiv 2022年

作者： Chatterjee, Soumick Sciarra, Alessandro Dünnwald, Max Tummala, Pavan Agrawal, Shubham Kumar Jauhari, Aishwarya Kalra, Aman Oeltze-Jafra, Steffen Speck, Oliver Nürnberger, Andreas Faculty of Computer Science Otto von Guericke University Magdeburg Germany Data and Knowledge Engineering Group Otto von Guericke University Magdeburg Germany Biomedical Magnetic Resonance Otto von Guericke University Magdeburg Germany MedDigit Department of Neurology Medical Faculty University Hospital Magdeburg Germany German Center for Neurodegenerative Disease Magdeburg Germany Center for Behavioral Brain Sciences Magdeburg Germany Leibniz Institute for Neurobiology Magdeburg Germany

Expert interpretation of anatomical images of the human brain is the central part of neuro-radiology. Several machine learning-based techniques have been proposed to assist in the analysis process. However, the ML models typically need to be trained to perform a specific task, e.g., brain tumour segmentation or classification. Not only do the corresponding training data require laborious manual annotations, but a wide variety of abnormalities can be present in a human brain MRI - even more than one simultaneously, which renders a representation of all possible anomalies very challenging. Hence, a possible solution is an unsupervised anomaly detection (UAD) system that can learn a data distribution from an unlabelled dataset of healthy subjects and then be applied to detect out-of-distribution samples. Such a technique can then be used to detect anomalies - lesions or abnormalities, for example, brain tumours, without explicitly training the model for that specific pathology. Several Variational Autoencoder (VAE) based techniques have been proposed in the past for this task. Even though they perform very well on controlled artificially simulated anomalies, many of them perform poorly while detecting anomalies in clinical data. This research proposes a compact version of the "context-encoding" VAE (ceVAE) model, combined with pre and post-processing steps, creating a UAD pipeline (StRegA), which is more robust on clinical data and shows its applicability in detecting anomalies such as tumours in brain MRIs. The proposed pipeline achieved a Dice score of 0.642±0.101 while detecting tumours in T2w images of the BraTS dataset and 0.859±0.112 while detecting artificially induced anomalies, while the best performing baseline achieved 0.522 ±0.135 and 0.783 ±0.111, respectively. Copyright © 2022, The Authors. All rights reserved.

关键词： Tumors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：