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

3rd International Conference on Educational Technology, ICET 2023

作者： Jiang, Mingchi Huang, Xiao Liu, Dandan Hu, Shengbo School of Big Data and Computer Science Guizhou Normal University Guiyang China

ISBN: (纸本)9798350302332

In order to solve the problem of unscientific setting of evaluation indicators due to the non-standardized evaluation scale of college students, we propose to use random forest algorithm to model and analyze the evaluation indicators of students. Taking the course "Programming Fundamentals"as an example, the teaching evaluation questionnaire is designed, and the random forest algorithm is used to model, compare the measured value and predicted value of the comprehensive scores, and obtain the importance ranking of the teaching evaluation indicators. The experimental results show that teaching effect, Language expression and other teaching evaluation indicators occupy an important position in the scale of university students' evaluation, and have important reference value for the design of the scale. © 2023 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Lay CO:Achieving Least Lossy Accuracy for Most Efficient RRAM-Based Deep Neural Network Accelerator via Layer-Centric Co-Optimization

引用

计算机科学技术学报（英文版） 2023年第2期38卷 328-347页

作者： Shao-Feng Zhao Fang Wang Bo Liu Dan Feng Yang Liu Wuhan National Laboratory for Optoelectronics Huazhong University of Science and TechnologyWuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Cloud Computing and Big Data Institute Henan University of Economics and LawZhengzhou 450001China Wuhan National Laboratory for Optoelectronics Huazhong University of Science and TechnologyWuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Research Institute of Huazhong University of Science and Technology in Shenzhen Shenzhen 518057China School of Computer and Artificial Intelligence Zhengzhou UniversityZhengzhou 450001China Wuhan National Laboratory for Optoelectronics Huazhong University of Science and TechnologyWuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Cloud Computing and Big Data Institute Henan University of Economics and LawZhengzhou 450001China

Resistive random access memory(RRAM)enables the functionality of operating massively parallel dot prod-ucts and ***-based accelerator is such an effective approach to bridging the gap between Internet of Things devices'constrained resources and deep neural networks'tremendous *** to the huge overhead of Analog to Digital(A/D)and digital accumulations,analog RRAM buffer is introduced to extend the processing in analog and in *** analog RRAM buffer offers potential solutions to A/D conversion issues,the energy consumption is still challenging in resource-constrained environments,especially with enormous intermediate data ***,criti-cal concerns over endurance must also be resolved before the RRAM buffer could be frequently used in reality for DNN in-ference *** we propose LayCO,a layer-centric co-optimizing scheme to address the energy and endurance con-cerns altogether while strictly providing an inference accuracy *** relies on two key ideas:1)co-optimizing with reduced supply voltage and reduced bit-width of accelerator architectures to increase the DNN's error tolerance and achieve the accelerator's energy efficiency,and 2)efficiently mapping and swapping individual DNN data to a correspond-ing RRAM partition in a way that meets the endurance *** evaluation with representative DNN models demonstrates that LayCO outperforms the baseline RRAM buffer based accelerator by 27x improvement in energy effi-ciency(over TIMELY-like configuration),308x in lifetime prolongation and 6x in area reduction(over RAQ)while main-taining the DNN accuracy loss less than 1％.

关键词： deep learning accelerator resistive random access memory (RRAM) energy efficiency error tolerance

来源：评论

学校读者我要写书评

暂无评论

Towards Exploring Large Molecular Space:An Efficient Chemical Genetic Algorithm

引用

Journal of computer science & Technology 2022年第6期37卷 1464-1477页

作者： Jian-Fu Zhu Zhong-Kai Hao Qi Liu Yu Yin Cheng-Qiang Lu Zhen-Ya Huang En-Hong Chen Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefei 230026China

Generating molecules with desired properties is an important task in chemistry and *** efficient method may have a positive impact on finding drugs to treat diseases like *** mining and artificial intelligence may be good ways to find an efficient ***,both the generative models based on deep learning and the work based on genetic algorithms have made some progress in generating molecules and optimizing the molecule’s ***,existing methods have defects in the experimental evaluation *** methods also need to be improved in efficiency and *** solve these problems,we propose a method named the Chemical Genetic Algorithm for Large Molecular Space(CALM).Specifically,CALM employs a scalable and efficient molecular representation called molecular *** we design corresponding crossover,mutation,and mask operators inspired by domain knowledge and previous *** apply our genetic algorithm to several tasks related to molecular property optimization and constraint molecular *** results of these tasks show that our approach outperforms the other state-of-the-art deep learning and genetic algorithm methods,where the z tests performed on the results of several experiments show that our method is more than 99%likely to be *** the same time,based on the experimental results,we point out the defects in the experimental evaluation standard which affects the fair evaluation of all previous *** these defects helps to objectively evaluate the performance of all work.

关键词： data mining molecular generation genetic algorithm drug discovery artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Eight Points Geometric Constraint for Stereo Matching 9

Eight Points Geometric Constraint for Stereo Matching

引用

9th International Conference on Systems and Informatics, ICSAI 2023

作者： Wang, Yuanbin Xiamen Institute of Technology School of Data and Computer Science Xiamen361021 China

ISBN: (纸本)9798350383706

Stereo point matching is a critical and fundamental problem in 3D vision. Numerous algorithms have been proposed to solve this problem. Since images obtained from 3D to 2D projection of a 3D scene lose depth information of the 3D scene, there is no numerical geometric invariant between stereo images. So, we do not have similar algorithms that use geometric invariants for point matching as in the case of 2D to 2D projective transformations. However, it is discovered that geometric constraints can be used to restrict the search space and eliminate faulty correspondences. In this paper we derive a new mathematical constraint relating eight corresponding points in stereo images. It is a simple formula consisting of coordinates of the eight points that compute to zero for the eight points to be in correspondence. This constraint can be used as a preliminary necessity testing step before other time-consuming methods to speed up the matching procedure. © 2023 IEEE.

关键词： Stereo image processing

来源：评论

学校读者我要写书评

暂无评论

Enhancing Document-Level Relation Extraction through Entity-Pair-Level Interaction Modeling

Enhancing Document-Level Relation Extraction through Entity-...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Liu, Wanlong Zeng, Dingyi Zhou, Li Xiao, Yichen Zhang, Malu Chen, Wenyu School of Computer Science and Engineering University of Electronic Science and Technology of China China School of Data Science The Chinese University of Hong Kong Shenzhen China

ISBN: (纸本)9798350368741

Document-level relation extraction aims at extracting relational facts between two entities in a document. Existing approaches mainly focus on target entities, utilizing techniques such as graph neural networks to enhance their representations. However, they ignore the rich semantic correlations among entity pairs which provide wider and multifaceted information at a higher level. In this paper, we propose the Relation-based Entity-pair-level Inference (REI) model, which facilitates information interaction at the entity-pair level, enhancing logical reasoning among entities and capturing semantic correlations among entity pairs. Our REI model comprises two modules: Relation-based Information Aggregation (RIA) and Entity-pair-level Information Interaction (EII). The RIA module builds and integrates relation representations to filter out distractions from unrelated entity pairs, while the EII module models entity-pair-level information interaction through multi-head attentions. Extensive experiments on the DocRED, DWIE, CDR, and GDA datasets demonstrate the superiority of the proposed REI model, outperforming previous state-of-the-art approaches. Furthermore, we provide detailed experimental analyses based on the performance gains and illustrate the interpretability. © 2025 IEEE.

关键词： Information Extraction Linguistic Inference Natural Language Processing Relation Extraction

来源：评论

学校读者我要写书评

暂无评论

A Multimodal Multiobjective Evolutionary Algorithm for Filter Feature Selection in Multilabel Classification

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第9期5卷 4428-4442页

作者： Hancer, Emrah Xue, Bing Zhang, Mengjie Victoria University of Wellington Center for Data Science and Artificial Intelligence School of Engineering and Computer Science Wellington6140 New Zealand Mehmet Akif Ersoy University Department of Software Engineering Burdur15039 Turkey

Multilabel learning is an emergent topic that addresses the challenge of associating multiple labels with a single instance simultaneously. Multilabel datasets often exhibit high dimensionality with noisy, irrelevant, and redundant features. In recent years, multilabel feature selection (MLFS) has gained prominence as a crucial and emerging machine learning task due to its ability to handle such data effectively. However, existing approaches for MLFS often prioritize top-ranked features based on intrinsic data criteria, disregarding relationships within the feature subset. Additionally, compared with conventional feature selection, multiobjective evolutionary algorithms (MOEAs) have not been widely explored in the context of MLFS. This study aims to address these gaps by proposing a multimodal multiobjective evolutionary algorithm (MMOEA) called MMDE_SICD which incorporates a preelimination scheme, an improved initialization scheme, an exploration scheme inspired by genetic operations and a statistically inspired crowding distance scheme. The results show that the proposed MMDE_SICD algorithm can outperform a variety of MOEAs and MMOEAs as well as conventional MLFS algorithms. Notably, this study is the first of its kind to consider MLFS as a multimodal multiobjective problem. © 2020 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

SACNN-IDS: A self-attention convolutional neural network for intrusion detection in industrial internet of things

引用

CAAI Transactions on Intelligence Technology 2024年第6期9卷 1398-1411页

作者： Mimonah Al Qathrady Safi Ullah Mohammed S.Alshehri Jawad Ahmad Sultan Almakdi Samar M.Alqhtani Muazzam A.Khan Baraq Ghaleb Department of Information Systems College of Computer Science and Information SystemsNajran UniversityNajranSaudi Arabia Department of Computer Science Quaid-i-Azam UniversityIslamabadPakistan Department of Computer Science College of Computer Science and Information SystemsNajran UniversityNajranSaudi Arabia School of Computing Engineering and the Built EnvironmentEdinburgh Napier UniversityEdinburghUK ICESCO Chair Big Data Analytics and Edge Computing Quaid-i-Azam UniversityIslamabadPakistan

Industrial Internet of Things(IIoT)is a pervasive network of interlinked smart devices that provide a variety of intelligent computing services in industrial *** IIoT nodes operate confidential data(such as medical,transportation,military,etc.)which are reachable targets for hostile intruders due to their openness and varied *** Detection Systems(IDS)based on Machine Learning(ML)and Deep Learning(DL)techniques have got significant ***,existing ML and DL-based IDS still face a number of obstacles that must be *** instance,the existing DL approaches necessitate a substantial quantity of data for effective performance,which is not feasible to run on low-power and low-memory *** and fewer data potentially lead to low performance on existing *** paper proposes a self-attention convolutional neural network(SACNN)architecture for the detection of malicious activity in IIoT networks and an appropriate feature extraction method to extract the most significant *** proposed architecture has a self-attention layer to calculate the input attention and convolutional neural network(CNN)layers to process the assigned attention features for *** performance evaluation of the proposed SACNN architecture has been done with the Edge-IIoTset and X-IIoTID *** datasets encompassed the behaviours of contemporary IIoT communication protocols,the operations of state-of-the-art devices,various attack types,and diverse attack scenarios.

关键词： convolutional neural network deep learning industrial internet of things intrusion detection self-attention

来源：评论

学校读者我要写书评

暂无评论

Learning to Communicate Among Agents for Large-Scale Dynamic Path Planning With Genetic Programming Hyperheuristic

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1269-1283页

作者： Liao, Xiao-Cheng Hu, Xiao-Min Chen, Xiang-Ling Mei, Yi Jia, Ya-Hui Chen, Wei-Neng Victoria University of Wellington Centre for Data Science and Artificial Intelligence School of Engineering and Computer Science Wellington6140 New Zealand Guangdong University of Technology School of Computer Science and Technology Guangzhou510006 China Hanyang University Department of Electrical and Electronic Engineering Ansan15588 Korea Republic of South China University of Technology School of Future Technology Guangzhou510006 China Pazhou Lab Guangzhou510005 China South China University of Technology School of Computer Science and Engineering State Key Laboratory of Subtropical Building and Urban Science Guangzhou510006 China

Genetic programming hyperheuristic (GPHH) has recently become a promising methodology for large-scale dynamic path planning (LDPP) since it can produce reusable heuristics rather than disposable solutions. However, in this methodology, the extracted local and decentralized heuristic for agents that lack a global systemic view sometimes may be problematic. Therefore, a new challenge is to strike a balance between conciseness to improve generalization ability and incorporation of more global information to obtain better performance. In this work, we target the LDPP problem and propose a communication learning mechanism (ComLGP) for GPHH to address the above difficulties. In ComLGP, a communication function is introduced to serve as a communication protocol and exist in the form of an extra terminal in GPHH. Compared to the classic terminals which are fixed in genetic programing, this communication function undergoes optimization along with the evolutionary process of GPHH. In this way, the communication function can be learned which enables agents to communicate without a predefined communication protocol. Then, a caching and lazy updating mechanism for ComLGP is presented to accelerate the calculation of communication content. Last, we verified our method on 22 scenarios including two real world road networks. The experimental results demonstrate that the proposed ComLGP can successfully learn to communicate. Although in the absence of any manually designed communication features, ComLGP is capable of achieving performance competitive to the state-of-the-art method that employs a predefined communication protocol and outperforms the remaining compared methods in most scenarios. © 2020 IEEE.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

Effort-aware cross-project just-in-time defect prediction framework for mobile apps

引用

Frontiers of computer science 2022年第6期16卷 15-29页

作者： Tian CHENG Kunsong ZHAO Song SUN Muhammad MATEEN Junhao WEN School of Big Data and Software Engineering Chongqing UniversityChongqing401331China School of Computer Science Wuhan UniversityWuhan430072China Department of Computer Science Air University Multan CampusMultan60000Pakistan

As the boom of mobile devices,Android mobile apps play an irreplaceable roles in people’s daily life,which have the characteristics of frequent updates involving in many code commits to meet new ***-in-Time(JIT)defect prediction aims to identify whether the commit instances will bring defects into the new release of apps and provides immediate feedback to developers,which is more suitable to mobile *** the within-app defect prediction needs sufficient historical data to label the commit instances,which is inadequate in practice,one alternative method is to use the cross-project *** this work,we propose a novel method,called KAL,for cross-project JIT defect prediction task in the context of Android mobile *** specifically,KAL first transforms the commit instances into a high-dimensional feature space using kernel-based principal component analysis technique to obtain the representative ***,the adversarial learning technique is used to extract the common feature embedding for the model *** conduct experiments on 14 Android mobile apps and employ four effort-aware indicators for performance *** results on 182 cross-project pairs demonstrate that our proposed KAL method obtains better performance than 20 comparative methods.

关键词： kernel-based principal component analysis adversarial learning just-in-time defect prediction cross-project model

来源：评论

学校读者我要写书评

暂无评论

Probabilistic time series forecasting with deep non-linear state space models

引用

CAAI Transactions on Intelligence Technology 2023年第1期8卷 3-13页

作者： Heming Du Shouguo Du Wen Li School of Computer Science College of Engineering and Computer ScienceAustralian National UniversityCanberraAustralian Capital TerritoryAustralia Shanghai Municipal Big Data Center ShanghaiChina Department of Economic Statistics School of Statistics and InformationShanghai University of International Business and EconomicsShanghaiChina

Probabilistic time series forecasting aims at estimating future probabilistic distributions based on given time series *** is a widespread challenge in various tasks,such as risk management and decision *** investigate temporal patterns in time series data and predict subsequent probabilities,the state space model(SSM)provides a general *** of SSM achieve considerable success in many fields,such as engineering and ***,since underlying processes in real-world scenarios are usually unknown and complicated,actual time series observations are always irregular and ***,it is very difficult to determinate an SSM for classical statistical *** this paper,a general time series forecasting framework,called Deep Nonlinear State Space Model(DNLSSM),is proposed to predict the probabilistic distribution based on estimated underlying unknown processes from historical time series *** fuse deep neural networks and statistical methods to iteratively estimate states and network parameters and thus exploit intricate temporal patterns of time series *** particular,the unscented Kalman filter(UKF)is adopted to calculate marginal likelihoods and update distributions recursively for non-linear *** that,a non-linear Joseph form covariance update is developed to ensure that calculated covariance matrices in UKF updates are symmetric and positive ***,the authors enhance the tolerance of UKF to round-off errors and manage to combine UKF and deep neural *** this manner,the DNLSSM effectively models non-linear correlations between observed time series data and underlying dynamic *** in both synthetic and real-world datasets demonstrate that the DNLSSM consistently improves the accuracy of probability forecasts compared to the baseline methods.

关键词： Artificial Intelligence machine learning time series

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：