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

2018 3rd International Conference on Modelling, Simulation and Applied Mathematics(MSAM 2018)

作者： Wanli Song School of Information Engineering Nanjing Xiaozhuang University Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing XiaoZhuang University

The application of online examination is used more and more widely. Test paper composition is the core function in this application. Online examination system requires that the test paper should be quick and flexible, and the composition of questions should be reasonable and random. Test paper should not only meet the specific needs of users, ensure fairness, impartiality, but also be accurate and efficient. The intelligent test paper composition algorithm based on genetic algorithm is studied in this paper. Then this method is used to organize the structure of the test paper automatically, composites the examination content. Proposals are put forward to examines the degree of students' mastery of knowledge based on this method. This algorithm can automatically composite test papers according to the conditions of difficulty degree, knowledge coverage, and the proportion of questions. It can automatically composite test papers for online assessment. The practice of online testing system based on this algorithm shows that the algorithm is scientific and effective. On the premise of guaranteeing the quality of the test paper, it greatly improves the efficiency and pertinence of online testing. It is beneficial to improve students' learning efficiency and intellectualization of education.

关键词： test paper composition education intellectualization genetic algorithm E-learning

来源：评论

学校读者我要写书评

暂无评论

Deep Learning in Digital Breast Tomosynthesis: Current Status, Challenges, and Future Trends

MedComm

引用

MedComm 2025年第6期6卷 e70247页

作者： Ruoyun Wang Fanxuan Chen Haoman Chen Chenxing Lin Jincen Shuai Yutong Wu Lixiang Ma Xiaoqu Hu Min Wu Jin Wang Qi Zhao Jianwei Shuai Jingye Pan Oujiang Laboratory (Zhejiang Lab for Regenerative Medicine Vision and Brain Health) Wenzhou Institute University of Chinese Academy of Sciences Wenzhou China Wenzhou Medical University Wenzhou China UCSC Baskin School of Engineering University of California Santa Cruz California USA Department of Anatomy Histology & Embryology School of Basic Medical Sciences Fudan University Shanghai China Department of Medicine Harvard Medical School and Brigham and Women's Hospital Boston Massachusetts USA Joint Research Centre on Medicine The Affiliated Xiangshan Hospital of Wenzhou Medical University Ningbo China Stony Brook University Stony Brook New York USA School of Computer Science and Software Engineering University of Science and Technology Liaoning Anshan China Key Laboratory of Intelligent Treatment and Life Support for Critical Diseases of Zhejiang Province Wenzhou China Department of Big Data in Health Science The First Affiliated Hospital of Wenzhou Medical University Wenzhou China Zhejiang Engineering Research Center for Hospital Emergency and Process Digitization Wenzhou China

The high-resolution three-dimensional (3D) images generated with digital breast tomosynthesis (DBT) in the screening of breast cancer offer new possibilities for early disease diagnosis. Early detection is especially important as the incidence of breast cancer increases. However, DBT also presents challenges in terms of poorer results for dense breasts, increased false positive rates, slightly higher radiation doses, and increased reading times. Deep learning (DL) has been shown to effectively increase the processing efficiency and diagnostic accuracy of DBT images. This article reviews the application and outlook of DL in DBT-based breast cancer screening. First, the fundamentals and challenges of DBT technology are introduced. The applications of DL in DBT are then grouped into three categories: diagnostic classification of breast diseases, lesion segmentation and detection, and medical image generation. Additionally, the current public databases for mammography are summarized in detail. Finally, this paper analyzes the main challenges in the application of DL techniques in DBT, such as the lack of public datasets and model training issues, and proposes possible directions for future research, including large language models, multisource domain transfer, and data augmentation, to encourage innovative applications of DL in medical imaging.

关键词： early breast cancer screening digital breast tomosynthesis deep learning public database medical image analysis

来源：评论

学校读者我要写书评

暂无评论

Unsupervised feature selection based on Markov blanket and particle swarm optimization

引用

Journal of Systems Engineering and Electronics 2017年第1期28卷 151-161页

作者： Yintong Wang Jiandong Wang Hao Liao Haiyan Chen College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiaozhuang University College of Computer Science and Software Engineering Shenzhen University

Feature selection plays an important role in data mining and recognition, especially in the large scale text, image and biological data. Specifically, the class label information is unavailable to guide the selection of minimal feature subset in unsupervised feature selection, which is challenging and interesting. An unsupervised feature selection based on Markov blanket and particle swarm optimization is proposed named as UFSMB-PSO. The proposed method seeks to find the high-quality feature subset through multi-particles' cooperation of particle swarm optimization without using any learning algorithms. Moreover, the features' relevance will be computed based on an information metric of relevance gain, which provides an information theoretical foundation for finding the minimization of the redundancy between features. Our results on several benchmark datasets demonstrate that UFSMB-PSO can achieve significant improvement over state of the art unsupervised methods. © 1990-2011 Beijing Institute of Aerospace Information.

关键词： Character recognition data mining Feature extraction Information theory

来源：评论

学校读者我要写书评

暂无评论

PSGAN: A GENERATIVE ADVERSARIAL NETWORK FOR REMOTE SENSING IMAGE PAN-SHARPENING

PSGAN: A GENERATIVE ADVERSARIAL NETWORK FOR REMOTE SENSING I...

引用

IEEE International Conference on Image Processing

作者： Xiangyu Liu Yunhong Wang Qingjie Liu Beijing Advanced Innovation Center for Big Data and Brain Computing Beijing Key Laboratory of Digital Media Beihang University Beijing China

Remote sensing image fusion (also known as pan-sharpening) aims to generate a high resolution multi-spectral image from inputs of a high spatial resolution single band panchromatic (PAN) image and a low spatial resolution multi-spectral (MS) image. In this paper, we propose PSGAN, a generative adversarial network (GAN) for remote sensing image pan-sharpening. To the best of our knowledge, this is the first attempt at producing high quality pan-sharpened images with GANs. The PSGAN consists of two parts. Firstly, a two-stream fusion architecture is designed to generate the desired high resolution multi-spectral images, then a fully convolutional network serving as a discriminator is applied to distinct "real" or "pan-sharpened" MS images. Experiments on images acquired by Quickbird and GaoFen-1 satellites demonstrate that the proposed PSGAN can fuse PAN and MS images effectively and significantly improve the results over the state of the art traditional and CNN based pan-sharpening methods.

关键词： Generators Gallium nitride Spatial resolution Remote sensing Task analysis Training

来源：评论

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

Systematic Resource Allocation in Cloud RAN with Caching as ...

引用

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

MemNetAR: Memory Network with Adversative Relation for Target-Level Sentiment Classification

MemNetAR: Memory Network with Adversative Relation for Targe...

引用

2019 IEEE Global Communications Conference (GLOBECOM)

作者： Yiwei Gao Jianwei Niu Xuefeng Liu Kaili Mao Shui Yu State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing (BDBC) Beihang University Hangzhou Innovation Research Institute Beihang University School of Computer Science and Cyber Engineering Guangzhou University Guangdong China

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

Target-level sentiment classification aims to identify the sentiment of multiple targets in a sentence. Although existing approaches based on neural network have achieved good performance in this task, we find that many approaches tend to give the same predictions for instances that have multiple targets, and this tendency can make a low accuracy for those instances that have different classes for different targets. Based on this observation, we propose MemNetAR, a memory network which can explicitly leverage the adversative relation among multiple targets in a sentence. Specifically, we add an adversative loss to the cross-entropy loss when there are adversative words between targets. The experimental results on public laptop and restaurant datasets prove that our model can improve 0.84% and 0.8% on total test dataset, and improve 2.97% and 2.68% on the dataset consisting of those instances with multiple targets but different classes by leveraging this new adversative information.

关键词： Task analysis Feature extraction Sentiment analysis Portable computers Machine learning Training Predictive models

来源：评论

学校读者我要写书评

暂无评论

Foundation models and intelligent decision-making: Progress, challenges, and perspectives

引用

The Innovation 2025年第6期6卷

作者： Jincai Huang Yongjun Xu Qi Wang Qi (Cheems) Wang Xingxing Liang Fei Wang Zhao Zhang Wei Wei Boxuan Zhang Libo Huang Jingru Chang Liantao Ma Ting Ma Yuxuan Liang Jie Zhang Jian Guo Xuhui Jiang Xinxin Fan Zhulin An Tingting Li Aiguo Fei Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China National Engineering Research Center for Software Engineering Peking University Beijing 100871 China College of Systems Engineering National University of Defense Technology Changsha 410073 China Department of Oral Implantology Peking University School and Hospital of Stomatology Beijing 100081 China Laboratory for Big Data and Decision National University of Defense Technology Changsha 410073 China School of Automation Beijing Institute of Technology Beijing 100081 China Huazhong University of Science and Technology Wuhan 430074 China University of Chinese Academy of Sciences Beijing 100049 China State Key Laboratory of AI Safety Beijing 100190 China Department of Automation Tsinghua University Beijing 100084 China School of Information Science and Engineering Dalian Polytechnic University Dalian 116034 China The Hong Kong University of Science and Technology (Guangzhou) Guangzhou 511453 China College of Information and Electrical Engineering China Agricultural University Beijing 100083 China State Key Laboratory of Efficient Utilization of Agricultural Water Resources Beijing 100083 China IDEA Research International Digital Economy Academy Shenzhen 518057 China School of Computer Science National Pilot Software Engineering School Beijing University of Posts and Telecommunications Beijing 100876 China

intelligent decision-making (IDM) is a cornerstone of artificial intelligence (AI) designed to automate or augment decision processes. Modern IDM paradigms integrate advanced frameworks to enable intelligent agents to make effective and adaptive choices and decompose complex tasks into manageable steps, such as AI agents and high-level reinforcement learning. Recent advances in multimodal foundation-based approaches unify diverse input modalities—such as vision, language, and sensory data—into a cohesive decision-making process. Foundation models (FMs) have become pivotal in science and industry, transforming decision-making and research capabilities. Their large-scale, multimodal data-processing abilities foster adaptability and interdisciplinary breakthroughs across fields such as healthcare, life sciences, and education. This survey examines IDM’s evolution, advanced paradigms with FMs and their transformative impact on decision-making across diverse scientific and industrial domains, highlighting the challenges and opportunities in building efficient, adaptive, and ethical decision systems.

关键词： artificial intelligence intelligent decision-making foundation models agent large language model

来源：评论

学校读者我要写书评

暂无评论

Interactive Ontology Matching Based on Evolutionary Algorithm

Interactive Ontology Matching Based on Evolutionary Algorith...

引用

International Conference on Computational Intelligence and Security

作者： Xingsi Xue Junfeng Chen Aihong Ren College of Information Science and Engineering Intelligent Information Processing Research Center Fujian Key Lab for Automotive Electronics and Electric Drive Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou China College of IOT Engineering Hohai University ChanZhou China School of Mathematics and Information Science Baoji University of Arts and Sciences Baoji China

ISBN: (数字)9781728160924

ISBN: (纸本)9781728160931

Since different ontologies are mostly developed independently, establishing meaningful links between their entities, so-called ontology matching, is critical to ensure their communication. Due to the complexity of the ontology matching problem, Evolutionary Algorithm (EA) can present a good methodology for determining ontology alignments. However, since none of the similarity measure can distinguish all the identical ontology entities in any context, ontology alignments generated by the automatic matching tools should be validated by the users to ensure their qualities. To improve the quality of the ontology alignment, in this work, a similarity measure is first proposed to calculate the similarity value of two ontology entities; then, an optimal model for ontology matching problem is constructed; after that, an EA-based automatic matcher is presented to solve the ontology matching problem, which can also adaptively determine the timing of getting user involved; and finally, the ontology concept hierarchy graph based reasoning approaches are proposed to tradeoff the user's workload and his work's effect. The experiment is conducted on the Interactive track provided by the Ontology Alignment Evaluation Initiative (OAEI), and the comparisons with OAEI's participants show the effectiveness of our proposal.

关键词： Ontologies Graph theory Pattern matching Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

Oscillatory evolution of collective behavior in evolutionary games played with reinforcement learning

arXiv

引用

arXiv 2019年

作者： Zhang, Si-Ping Zhang, Ji-Qiang Chen, Li Liu, Xu-Dong Key Laboratory of Biomedical Information Engineering Ministry of Education Key Laboratory of Neuro-informatics & Rehabilitation Engineering Ministry of Civil Affairs Institute of Health and Rehabilitation Science School of Life Science and Technology Xi'an Jiaotong University Xi'an710049 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China School of Physics and Information Technology Shaanxi Normal University Xi'an710062 China

Large-scale cooperation underpins the evolution of ecosystems and the human society, and the collective behaviors by self-organization of multi-agent systems are the key for understanding. As artificial intelligence (AI) prevails in almost all branches of science, it would be of great interest to see what new insights of collective behavior could be obtained from a multi-agent AI system. Here, we introduce a typical reinforcement learning (RL) algorithm - Q learning into evolutionary game dynamics, where agents pursue optimal action on the basis of the introspectiveness rather than the birth-death or imitation processes in the traditional evolutionary game (EG). We investigate the cooperation prevalence numerically for a general 2 × 2 game setting. We find that the cooperation prevalence in the multi-agent AI is amazingly of equal level as in the traditional EG in most cases. However, in the snowdrift games with RL we also reveal that explosive cooperation appears in the form of periodic oscillation, and we study the impact of the payoff structure on its emergence. Finally, we show that the periodic oscillation can also be observed in some other EGs with the RL algorithm, such as the rock-paper-scissors game. Our results offer a reference point to understand emergence of cooperation and oscillatory behaviors in nature and society from AI's perspective. Copyright © 2019, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

News Recommendation System Based on Collaborative Filtering and SVM

News Recommendation System Based on Collaborative Filtering ...

引用

2018 3rd International Conference on Automation, Mechanical and Electrical Engineering (AMEE 2018)

作者： Wan-li SONG School of Information Engineering Nanjing Xiaozhuang University Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiao Zhuang University

News system requires news classification and personalized recommendation to improve user's efficiency and interest, and to enhance user's experiences. This paper constructed a news automatic classification and recommendation system through natural language processing, text classification, collaborative filtering algorithm. The published news contents were word-segmented and model-trained automatically first to determine which category the news belonging to. Users can also manually modify the classification so that later classification can be updated and improved. After that, the similarity between users was calculated by collaborative filtering and the users having higher similarity with the recommended users were selected. The news seen by the certain users were recommended to the users that were divided into the same group. This paper takes the news corpus of Fudan University's text classification research center as experimental data. Text classification accuracy is tested by this corpus. The experimental results show that the system can serve the news users well. It achieves effective classification and recommendation of news personally.

关键词： Recommendation algorithm Automatic classification Similarity Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：