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

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

来源：评论

学校读者我要写书评

暂无评论

Adaptive ROI Optimization Pyramid Network: Lane Detection for FSD under Data Uncertainty

引用

engineering Letters 2025年第2期33卷 282-291页

作者： Cao, Xu Liu, Weisheng Wang, Zhijian College of Computer Science and Software Engineering University of Science and Technology Liaoning Anshan China College of Computer Science and Software Engineering University of Science and Technology Liaoning Co Anshan114051 China

To mitigate the challenges posed by data uncertainty in Full-Self Driving (FSD) systems. This paper proposes a novel feature extraction learning model called Adaptive Region of Interest Optimized Pyramid Network (ARO). Specifically, ARO introduces a novel cross-layer fusion attention mechanism that dynamically assigns weighted attention to feature maps across different levels, facilitating deep feature fusion and enabling the effective extraction and utilization of salient feature information. Furthermore, ARO incorporates a feature replication layer to duplicate and refine feature maps at multiple levels, thereby enhancing its capability to capture fine-grained details and generate richer feature representations. Additionally, a multi-path upsampling strategy preserves fine-grained features during upsampling. Extensive experimental evaluations conducted on the benchmark CuLane and Tusimple datasets demonstrate that ARO achieves an F1 score of 80.60% on the CuLane dataset, outperforming state-of-the-art methods, showcasing the effectiveness of the proposed approach in handling data uncertainty for robust lane detection in autonomous driving. Our code are available at https://***/caoxu0109/lane detect ldfr. © 2025, International Association of Engineers. All rights reserved.

关键词： Attention mechanisms Culane Lane detection Multi-scale fusion network Tusimple

来源：评论

学校读者我要写书评

暂无评论

Attribute grouping-based naive Bayesian classifier

引用

science China(Information sciences) 2025年第3期68卷 125-149页

作者： Yulin HE Guiliang OU Philippe FOURNIER-VIGER Joshua Zhexue HUANG Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ) College of Computer Science & Software Engineering Shenzhen University

The naive Bayesian classifier(NBC) is a supervised machine learning algorithm having a simple model structure and good theoretical interpretability. However, the generalization performance of NBC is limited to a large extent by the assumption of attribute independence. To address this issue, this paper proposes a novel attribute grouping-based NBC(AG-NBC), which is a variant of the classical NBC trained with different attribute groups. AG-NBC first applies a novel effective objective function to automatically identify optimal dependent attribute groups(DAGs). Condition attributes in the same DAG are strongly dependent on the class attribute, whereas attributes in different DAGs are independent of one another. Then,for each DAG, a random vector functional link network with a SoftMax layer is trained to output posterior probabilities in the form of joint probability density estimation. The NBC is trained using the grouping attributes that correspond to the original condition attributes. Extensive experiments were conducted to validate the rationality, feasibility, and effectiveness of AG-NBC. Our findings showed that the attribute groups chosen for NBC can accurately represent attribute dependencies and reduce overlaps between different posterior probability densities. In addition, the comparative results with NBC, flexible NBC(FNBC), tree augmented Bayes network(TAN), gain ratio-based attribute weighted naive Bayes(GRAWNB), averaged one-dependence estimators(AODE), weighted AODE(WAODE), independent component analysis-based NBC(ICA-NBC), hidden naive Bayesian(HNB) classifier, and correlation-based feature weighting filter for naive Bayes(CFW) show that AG-NBC obtains statistically better testing accuracies, higher area under the receiver operating characteristic curves(AUCs), and fewer probability mean square errors(PMSEs) than other Bayesian classifiers. The experimental results demonstrate that AG-NBC is a valid and efficient approach for alleviating the attribute i

关键词： naive Bayesian classifier attribute independence assumption attribute grouping dependent attribute group posterior probability class-conditional probability

来源：评论

学校读者我要写书评

暂无评论

VAT: Visibility Aware Transformer for Fine-Grained Clothed Human Reconstruction

引用

IEEE Transactions on Visualization and computer Graphics 2025年第5期31卷 2277-2287页

作者： Zhang, Xiaoyan Zhu, Zibin Xie, Hong Ren, Sisi Shenzhen University College of Computer Science and Software Engineering Shenzhen518000 China

In order to reconstruct 3D clothed human with accurate fine-grained details from sparse views, we propose a deep cooperating two-level global to fine-grained reconstruction framework that constructs robust global geometry to guide fine-grained geometry learning. The core of the framework is a novel visibility aware Transformer VAT, which bridges the two-level reconstruction architecture by connecting its global encoder and fine-grained decoder with two pixel-aligned implicit functions, respectively. The global encoder fuses semantic features of multiple views to integrate global geometric features. In the fine-grained decoder, visibility aware attention mechanism is designed to efficiently fuse multi-view and multi-scale features for mining fine-grained geometric features. The global encoder and fine-grained decoder are connected by a global embeding module to form a deep cooperation in the two-level framework, which provides global geometric embedding as a query guidance for calculating visibility aware attention in the fine-grained decoder. In addition, to extract highly aligned multi-scale features for the two-level reconstruction architecture, we design an image feature extractor MSUNet, which establishes strong semantic connections between different scales at minimal cost. Our proposed framework is end-to-end trainable, with all modules jointly optimized. We validate the effectiveness of our framework on public benchmarks, and experimental results demonstrate that our method has significant advantages over state-of-the-art methods in terms of both fine-grained performance and generalization. © 2025 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

CoSAF: Towards a Secure Meta-Computing IIoT Infrastructure through Collaborative Source Address Filtering

引用

IEEE Internet of Things Journal 2025年第10期12卷 13709-13722页

作者： Yang, Shu Zhang, Zequn Cui, Laizhong Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China

The rapid growth of the Industrial Internet of Things (IIoT) requires a secure Meta-Computing environment to support applications like industrial monitoring and remote control. However, this environment faces major security challenges, especially the risk of source address forgery, which can enable DDoS and botnet attacks, disrupting operations and compromising equipment. Current Internet infrastructure forwards packets based only on destination addresses, lacking the capability for source address verification. Although edge-based solutions like firewalls and systems such as SAVA (Source Address Validation Architecture) and SAVI (Source Address Validation Improvement) are deployed, they fall short of comprehensive source address validation (SAV), allowing malicious traffic to propagate through core networks. To enhance security, a collaborative approach based on Meta-Computing principles is needed, allowing routers to verify source addresses cooperatively. Given the impracticality of fully upgrading routers, incremental deployment is essential. We show that optimizing incremental SAV deployment is NP-hard. To address this, we propose COSAF (Collaborative Optimized Source Address Filtering), a heuristic algorithm that uses a sink-tree structure to effectively filter attack flows and optimize resource allocation. COSAF also takes SAV table capacity into account to improve resource utilization. Extensive simulations demonstrate that COSAF outperforms traditional methods. © 2025 IEEE.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

LoRaDIP: Low-Rank Adaptation With Deep Image Prior for Generative Low-Light Image Enhancement

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第4期6卷 909-920页

作者： Zhao, Zunjin Shi, Daming Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China

This article presents LoRaDIP, a novel low-light image enhancement (LLIE) model based on deep image priors (DIPs). While DIP-based enhancement models are known for their zero-shot learning, their expensive computational cost remains a challenge. In addressing this issue, our proposed LoRaDIP introduces a low-rank adaptation technique, significantly reducing computational expenses without compromising performance. The contributions of this work are threefold. First, we eliminate the need for estimating initial illumination and reflectance, opting instead to directly estimate the illumination map from the observed image in a generative fashion. The illumination is parameterized by a DIP network. Second, considering the overparameterization of DIP networks, we introduce a low-rank adaptation technique to decrease the number of trainable parameters, thereby reducing computational demands. Third, differing from the existing DIP-based models that rely on a preset fixed number of iterations to halt the optimization process of Retinex decomposition, we propose an automatic stopping criterion based on stable rank, preventing unnecessary iterations. LoRaDIP not only inherits the advantage of requiring only the single input image but also exhibits reduced computational costs while maintaining or even surpassing the performance of state-of-the-art models. © 2020 IEEE.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

AsyCo: an asymmetric dual-task co-training model for partial-label learning

引用

science China(Information sciences) 2025年第5期68卷 332-347页

作者： Beibei LI Yiyuan ZHENG Beihong JIN Tao XIANG Haobo WANG Lei FENG College of Computer Science Chongqing University State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences School of Software Technology Zhejiang University School of Computer Science and Engineering Nanyang Technological University

Partial-label learning(PLL) is a typical problem of weakly supervised learning, where each training instance is annotated with a set of candidate labels. Self-training PLL models achieve state-of-the-art performance but suffer from error accumulation problems caused by mistakenly disambiguated instances. Although co-training can alleviate this issue by training two networks simultaneously and allowing them to interact with each other, most existing co-training methods train two structurally identical networks with the same task, i.e., are symmetric, rendering it insufficient for them to correct each other due to their similar limitations. Therefore, in this paper, we propose an asymmetric dual-task co-training PLL model called AsyCo,which forces its two networks, i.e., a disambiguation network and an auxiliary network, to learn from different views explicitly by optimizing distinct tasks. Specifically, the disambiguation network is trained with a self-training PLL task to learn label confidence, while the auxiliary network is trained in a supervised learning paradigm to learn from the noisy pairwise similarity labels that are constructed according to the learned label confidence. Finally, the error accumulation problem is mitigated via information distillation and confidence refinement. Extensive experiments on both uniform and instance-dependent partially labeled datasets demonstrate the effectiveness of AsyCo.

关键词： machine learning weakly supervised learning partial-label learning co-training models candidate label sets

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Successive Interference Cancellation-Enabled Timely Status Update in Linear Multi-hop Wireless Networks

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 5298-5311页

作者： Han, Xinhui Pan, Haoyuan Wang, Zhaorui Li, Jianqiang Shenzhen University College of Computer Science and Software Engineering Shenzhen China Future Network of Intelligence Institute The School of Science and Engineering Shenzhen China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology The College of Computer Science and Software Engineering Shenzhen China

We investigate the timely status update in linear multi-hop wireless networks, where a source tries to deliver status update packets to a destination through a sequence of half-duplex relays. Timeliness is measured by the age of information (AoI) metric. Maintaining a low AoI at the destination typically necessitates frequent transmission of update packets from the source. However, high packet transmission frequency in multi-hop scenarios can result in mutual wireless interference at intermediate relays. Specifically, when an intermediate relay receives wireless signals of a new packet from its previous node, simultaneous transmission of an old packet by its subsequent node to the next hop may cause wireless signals to interfere at the intermediate relay, conventionally leading to packet collision. A key motivation to solve this issue is that the intermediate relay has previously received the old packet (which can thus be forwarded to the subsequent node for further relaying). Hence, successive interference cancellation (SIC) can be employed to mitigate interference of the old packet and recover the new packet. This paper designs an SIC-enabled packet relaying scheme tailored to low AoI. Initially focusing on a three-hop network, we subsequently extend our approach to general multi-hop networks. We model the multi-hop relaying scheme using a Markov chain to derive the theoretical average AoI. Theoretical and simulation results indicate that the SIC-enabled packet relaying scheme significantly reduces the average AoI compared to the non-SIC approaches, owing to an increased packet transmission frequency at the source and the effectiveness of SIC techniques at the relays. © 2002-2012 IEEE.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

Multi-Task Chinese Speech Recognition Method Based on the Squeezeformer Model

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer science 2025年第1期52卷 23-31页

作者： Guo, Ying Wang, Li School of Computer Science and software Engineering University of Science and Technology Liaoning Anshan114051 China College of Computer Science and Technology Liaoning Anshan114051 China

End-to-end training has emerged as a prominent trend in speech recognition, with Conformer models effectively integrating Transformer and CNN architectures. However, their complexity and high computational cost pose deployment challenges. To address these issues, we propose a multi-task Chinese speech recognition method based on the Squeezeformer model. We replace the FMCF structure in Conformer with an MF/CF structure, leveraging the convolutional module as a local Multi- Head Attention (MHA) module to enhance efficiency. Multilevel down-sampling and up-sampling using a time-series U-Net further reduce computational costs. By eliminating redundant LayerNorm layers and employing depthwise separable convolutions, we streamline the model, reduce parameters, and lower deployment costs. An Adaptor Layer is integrated into the MHSA module to mitigate the vanishing gradient problem, and a ScaleVar Layer is added to enhance flexibility. Additionally, the RealFormer module is introduced on the decoding side to improve context understanding. Combining Connectionist Temporal Classification (CTC) with attention-based encoding and decoding models for multi-task learning improves performance and accuracy. Experimental results show that the proposed method reduces the parameters on AISHELL-1 dataset by 16% and reduces the character error rate to 5.50%. At the same time, it also shows good performance on AISHELL-2 dataset. © (2025), (International Association of Engineers). All rights reserved.

关键词： Speech recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：