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

Research on helping employment difficulties of students by department of computer science and software engineering,Jincheng college of Sichuan University

Research on helping employment difficulties of students by d...

引用

2014 International Conference on Information engineering and Education science

作者： Ling Hou Department of Computer Science and Software Engineering Jincheng College of Sichuan University

In developing school,every university should pay full attention to employment-oriented development of each *** outstanding students or stylistic active students,schools should set up the appropriate platform,so that they play a meaningful role,and be demonstrated,especially the employment difficulties faced by the students,they need to be more concerned *** should take effective measures to them,and help needy students to solve the problems pertinently,and then make them back to normal *** article took Sichuan University,Jin Cheng College of computer science and software engineering for example to research helping employment difficulties faced by *** practical work,we explored a classification for students from poor management,and use the bedroom and class structures difficult for students to demonstrate the platform,practical and effective measures to counselor part-time teacher two fold emotional care models.

关键词： help employment difficulties category management class activities part-time teacher

来源：评论

学校读者我要写书评

暂无评论

Deep ensemble learning for gastrointestinal diagnosis using endoscopic image classification

引用

PeerJ computer science 2025年 11卷 1-21页

作者： Siddiqui, Samra Khan, Junaid Ali Algamdi, Shabbab Department of Computer Science HITEC University Taxila Pakistan Department of Software Engineering College of Computer Science and Engineering Prince Sattam bin AbdulAziz University AlKharj Saudi Arabia

Transfer learning is a valuable tool for the effective assistance of gastroenterologists in the powerful diagnosis of medical images with fast convergence. It also intends to minimize the time and estimated effort required for improved gastrointestinal tract (GIT) diagnosis. GIT abnormalities are widely known to be fatal disorders leading to significant mortalities. It includes both upper and lower GIT disorders. The challenges of addressing GIT issues are complex and need significant study. Multiple challenges exist regarding computer-aided diagnosis (CAD) and endoscopy including a lack of annotated images, dark backgrounds, less contrast, noisy backgrounds, and irregular patterns. Deep learning and transfer learning have assisted gastroenterologists in effective diagnosis in various ways. The goal of proposed framework is the effective classification of endoscopic GIT images with enhanced accuracy. The proposed research aims to formulate a transfer learning-based deep ensemble model, accurately classifying GIT disorders for therapeutic purposes. The proposed model is based on weighted voting ensemble of the two state-of-the-art (STA) base models, NasNet-Mobile and EfficientNet. The extraction of regions of interest, specifically the sick portions, have been performed using images captured from endoscopic procedure. Performance evaluation of the proposed model is performed with cross-dataset evaluation. The datasets utilized include the training dataset HyperKvasir and two test datasets, Kvasir v1 and Kvasir v2. However, the dataset alone cannot create a robust model due to the unequal distribution of images across categories, making transfer learning a promising approach for model development. The evaluation of the proposed framework has been conducted by cross-dataset evaluation utilizing accuracy, precision, recall, Area under curve (AUC) score and F1 score performance metrics. The proposed work outperforms much of the existing transfer learning-based models giv

关键词： Endoscopy

来源：评论

学校读者我要写书评

暂无评论

An infrastructure software perspective toward computation offloading between executable specifications and foundation models

引用

science China(Information sciences) 2025年第4期68卷 380-382页

作者： Dezhi RAN Mengzhou WU Yuan CAO Assaf MARRON David HAREL Tao XIE Key Laboratory of High Confidence Software Technologies (PKU) Ministry of Education School of Computer SciencePeking University School of Electronics Engineering and Computer Science Peking University Department of Computer Science and Applied Mathematics Weizmann Institute of Science

Foundation models(FMs) [1] have revolutionized software development and become the core components of large software systems. This paradigm shift, however, demands fundamental re-imagining of software engineering theories and methodologies [2]. Instead of replacing existing software modules implemented by symbolic logic, incorporating FMs' capabilities to build software systems requires entirely new modules that leverage the unique capabilities of ***, while FMs excel at handling uncertainty, recognizing patterns, and processing unstructured data, we need new engineering theories that support the paradigm shift from explicitly programming and maintaining user-defined symbolic logic to creating rich, expressive requirements that FMs can accurately perceive and implement.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A survey on cross-user federated recommendation

引用

science China(Information sciences) 2025年第4期68卷 7-32页

作者： Enyue YANG Yudi XIONG Wei YUAN Weike PAN Qiang YANG Zhong MING College of Computer Science and Software Engineering Shenzhen University School of Electrical Engineering and Computer Science The University of Queensland WeBank AI Lab WeBank Department of Computer Science and Engineering Hong Kong University of Science and Technology College of Big Data and Internet Shenzhen Technology University Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ)

Recommender systems are effective in mitigating information overload, yet the centralized storage of user data raises significant privacy concerns. Cross-user federated recommendation(CUFR) provides a promising distributed paradigm to address these concerns by enabling privacy-preserving recommendations directly on user devices. In this survey, we review and categorize current progress in CUFR, focusing on four key aspects: privacy, security, accuracy, and efficiency. Firstly,we conduct an in-depth privacy analysis, discuss various cases of privacy leakage, and then review recent methods for privacy protection. Secondly, we analyze security concerns and review recent methods for untargeted and targeted *** untargeted attack methods, we categorize them into data poisoning attack methods and parameter poisoning attack methods. For targeted attack methods, we categorize them into user-based methods and item-based methods. Thirdly,we provide an overview of the federated variants of some representative methods, and then review the recent methods for improving accuracy from two categories: data heterogeneity and high-order information. Fourthly, we review recent methods for improving training efficiency from two categories: client sampling and model compression. Finally, we conclude this survey and explore some potential future research topics in CUFR.

关键词： cross-user federated recommendation federated recommendation federated learning recommender systems user privacy

来源：评论

学校读者我要写书评

暂无评论

DevDynaP: A Dynamic Local Community Detection Algorithm

引用

SN computer science 2025年第4期6卷 1-11页

作者： Bakhtar, Sahar Harutyunyan, Hovhannes A. Department of Computer Science and Software Engineering Concordia University Montreal Canada

Recent years have witnessed the rapid growth of social network services. Real-world social networks are huge and changing over time. Consequently, the problems in this area have become more complex. Community detection is one of the most important problems in social networks. A good community can be defined as a group of nodes that are highly connected to each other and loosely connected to the nodes outside the community. Regarding the fact that social networks are huge in size, having complete information about the whole network is almost impossible. As a result, the problem of local community detection has become more popular in recent years. However, the problem of community detection in dynamic networks is well-investigated, the local community detection is not widely addressed by researchers in dynamic networks. In this paper, a dynamic local community detection algorithm is proposed. The purpose of the proposed algorithm is to explore the network as fast as possible and detect communities as well. Experimental results show that the proposed algorithm discovers the unknown parts of networks faster than similar algorithms. Also, the detected communities by the proposed algorithm outperform that of the compared algorithm in different snapshots. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2025.

关键词： Dynamic social network Geodesic distance metric Local community detection Modularity

来源：评论

学校读者我要写书评

暂无评论

Enhancing Voice Phishing Detection Using Multilingual Back-Translation and SMOTE: An Empirical Study

引用

IEEE Access 2025年 13卷 37946-37965页

作者： Boussougou, Milandu Keith Moussavou Hamandawana, Prince Park, Dong-Joo Soongsil University Department of Computer Science and Engineering Seoul06978 Korea Republic of Ajou University Department of Software and Computer Engineering Suwon16499 Korea Republic of Soongsil University School of Computer Science and Engineering Seoul06978 Korea Republic of

With the widespread global trend of voice phishing or vishing attacks, the development of effective detection models using artificial intelligence (AI) has been hindered by the lack of high-quality and large volumes of data. This lack of data reflecting a real vishing scenario often leads to imbalanced datasets and biased detection models. Therefore, we present in this paper a data augmentation (DA) method for expanding the imbalanced Korean call content vishing (KorCCVi) dataset to address the existing data asymmetry problem and enhance the performance of Korean vishing detection. The proposed approach for DA involves using the back-translation (BT) method with three different intermediate languages: English, Chinese, and Japanese. The proposed method offers several advantages over the traditional synthetic minority oversampling technique (SMOTE), which is the main technique used to compare with our multilingual BT approach. Using these two DA techniques, several machine learning (ML) and deep learning (DL) models were trained on the original imbalanced dataset, the dataset balanced with SMOTE and its variants, and the dataset augmented with our method. We analyzed the impact of these DA methods on the performance of the models, demonstrated the benefits of each approach, and suggested the most suitable approach. The performance of the trained models was evaluated using the accuracy, precision, recall, and F1-score metrics. The experimental results demonstrated that the proposed multilingual BT method effectively expands the dataset while preserving its contextual and linguistic characteristics. The average performance of the models revealed that those trained on the augmented dataset outperformed the other models. They achieved F1-scores of 98.91% for the back-translated data, 98.14% for the original data, and 97.23% for SMOTE. © 2025 The Authors. This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecomm

关键词： Phishing

来源：评论

学校读者我要写书评

暂无评论

A mathematical multi-objective optimization model and metaheuristic algorithm for effective advertising in the social internet of things

引用

Neural Computing and Applications 2025年第6期37卷 4797-4821页

作者： Molaei, Reza Rahsepar Fard, Kheirollah Bouyer, Asgarali Department of Computer Engineering and Information Technology University of Qom Qom Iran Department of Software Engineering Azarbaijan Shahid Madani University Tabriz Iran Department of Software Engineering Faculty of Engineering and Natural Science Istinye University Istanbul Turkey

The integration of social networks with the Internet of Things (IoT) has been explored in recent research, giving rise to the Social Internet of Things (SIoT). One promising application of SIoT is viral marketing, which plays a critical role in modern advertising. However, current solutions proposed for viral marketing are often impractical in real-world scenarios, and there has been limited investigation into viral marketing within the context of SIoT. To address this issue, we present a multi-objective integer linear programming model named ILP-ASoT that facilitates advertising through SIoT. Our approach introduces two realistic parameters: the node sociality rate and the node appropriateness rate as an advertising destination. By balancing the cost of selecting a seed set with the number of users who receive the advertisement, our model offers an appropriate trade-off. Since this is proven as an NP-hard problem, A PSO-based metaheuristic algorithm is proposed to provide near-optimal solutions for advertising in SIoT, called PSO-ASoT. Through simulations, we show that our PSO-ASoT algorithm outperforms state-of-the-art algorithms in several metrics, such as influence spread, advertising cost, and duplicated advertising rate. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Clustered Reinforcement Learning

引用

Frontiers of computer science 2025年第4期19卷 43-57页

作者： Xiao MA Shen-Yi ZHAO Zhao-Heng YIN Wu-Jun LI National Key Laboratory for Novel Software Technology Department of Computer Science and TechnologyNanjing UniversityNanjing 210023China Department of Electrical Engineering and Computer Sciences University of CaliforniaBerkeleyCA 94720-1770USA

Exploration strategy design is a challenging problem in reinforcement learning(RL),especially when the environment contains a large state space or sparse *** exploration,the agent tries to discover unexplored(novel)areas or high reward(quality)*** existing methods perform exploration by only utilizing the novelty of *** novelty and quality in the neighboring area of the current state have not been well utilized to simultaneously guide the agent’s *** address this problem,this paper proposes a novel RL framework,called clustered reinforcement learning(CRL),for efficient exploration in *** adopts clustering to divide the collected states into several clusters,based on which a bonus reward reflecting both novelty and quality in the neighboring area(cluster)of the current state is given to the *** leverages these bonus rewards to guide the agent to perform efficient ***,CRL can be combined with existing exploration strategies to improve their performance,as the bonus rewards employed by these existing exploration strategies solely capture the novelty of *** on four continuous control tasks and six hard-exploration Atari-2600 games show that our method can outperform other state-of-the-art methods to achieve the best performance.

关键词： deep reinforcement learning exploration count-based method clustering K-means

来源：评论

学校读者我要写书评

暂无评论

Skeleton-Aware Graph-Based Adversarial Networks for Human Pose Estimation from Sparse IMUs

引用

ACM Transactions on Multimedia Computing, Communications and Applications 2025年第4期21卷 1-22页

作者： Chen, Kaixin Zhang, Lin Wang, Zhong Zhao, Shengjie Zhou, Yicong School of Software Engineering Tongji University Shanghai China Department of Computer and Information Science University of Macau Macau China

Recently, sparse-inertial human pose estimation (SI-HPE) with only a few IMUs has shown great potential in various fields. The most advanced work in this area achieved fairish results using only six IMUs. However, there are still two major issues that remain to be addressed. First, existing methods typically treat SI-HPE as a temporal sequential learning problem and often ignore the important spatial prior of skeletal topology. Second, there are far more synthetic data in their training data than real data, and the data distribution of synthetic data and real data is quite different, which makes it difficult for the model to be applied to more diverse real data. To address these issues, we propose "Graph-based Adversarial Inertial Poser (GAIP),"which tracks body movements using sparse data from six IMUs. To make full use of the spatial prior, we design a multi-stage pose regressor with graph convolution to explicitly learn the skeletal topology. A joint position loss is also introduced to implicitly mine spatial information. To enhance the generalization ability, we propose supervising the pose regression with an adversarial loss from a discriminator, bringing the ability of adversarial networks to learn implicit constraints into full play. Additionally, we construct a real dataset that includes hip support movements and a synthetic dataset containing various motion categories to enrich the diversity of inertial data for SI-HPE. Extensive experiments demonstrate that GAIP produces results with more precise limb movement amplitudes and relative joint positions, accompanied by smaller joint angle and position errors compared to state-of-the-art counterparts. The datasets and codes are publicly available at https://***/GAIP/. © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Network theory (graphs)

来源：评论

学校读者我要写书评

暂无评论

#REval: A Semantic Evaluation Framework for Hashtag Recommendation

引用

IEEE Transactions on Knowledge and Data engineering 2025年第6期37卷 3075-3087页

作者： Alsini, Areej Huynh, Du Q. Datta, Amitava Umm Al-Qura University Department of Computer Science and Artificial Intelligence Makkah24382 Saudi Arabia The University of Western Australia Department of Computer Science and Software Engineering Perth6009 Australia

Automatic evaluation of hashtag recommendation models is a fundamental task in Twitter. In the traditional evaluation methods, the recommended hashtags from an algorithm are first compared with the ground truth hashtags for exact correspondences. The number of exact matches is then used to calculate the hit rate, hit ratio, precision, recall, or F1-score. This way of evaluating hashtag similarities is inadequate as it ignores the semantic correlation between the recommended and ground truth hashtags. To tackle this problem, we propose a novel semantic evaluation framework for hashtag recommendation, called #REval. This framework includes an internal module referred to as BERTag, which automatically learns the hashtag embeddings. We investigate on how the #REval framework performs under different word embedding methods and different numbers of synonyms and hashtags in the recommendation using our proposed #REval-hit-ratio measure. Our experiments of the proposed framework on three large datasets show that #REval gave more meaningful hashtag synonyms for hashtag recommendation evaluation. Our analysis also highlights the sensitivity of the framework to the word embedding technique, with #REval based on BERTag more superior over #REval based on Word2Vec, FastText, and GloVe. © 2025 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：