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

Person Re-Identification Algorithm Based on Improved ResNet

IAENG International Journal of Applied Mathematics 2024年第5期54卷 894-901页

作者： Shen, Wenrui Wang, Zhifeng School of Computer Science and Software Engineering University of Science and Technology Liaoning Anshan114051 China School of Computer Science and Software Engineering University of Science and Technology Liaoning Anshan114051 China

Person Re-Identification falls within the scope of computer vision, acting a technique to ascertain the presence of a specified pedestrian within a video or image library. The related research is of great significance in real-world environments such as criminal investigation and statistical analysis of commercial foot traffic and has received extensive attention from the academic community. However, traditional methods such as manual extraction cannot adapt to large-scale data volumes, and deep learning-based methods at this stage suffer from interference in complex environments such as similar costumes, perspective changes, and occlusion. Therefore, in this paper, we investigate the above problems. Firstly, we expand the dataset by introducing random erasure-based preprocessing of pedestrian images to enhancing the robustness and generalization capability of neural networks. Secondly, a composite attention mechanism is introduced after the network residual layer to enhance the spatial information capability and feature expression. Finally, the union loss composed of Circle Loss, Ternary Loss, and Cross Entropy Loss was chosen for network training in the loss optimization phase. Findings from the experiments reveal that the improved method proposed in this experiment achieves 96.0%Rank-1 and 88.3%mAP in Market1501, which reflects the validity of the approach proposed in this manuscript, and provides valuable reference suggestions for Person Re-Identification related research. © (2024), (International Association of Engineers). All Rights Reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Time-enhanced Dynamic Graph Network for Next POI Recommendation

Time-enhanced Dynamic Graph Network for Next POI Recommendat...

引用

2024 International Symposium on Internet of Things and Smart Cities, ISITSC 2024

作者： Liu, Zhao Liu, Wei Chen, Junyang School of Artificial Intelligence Sun Yat-sen University Zhuhai China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (纸本)9798331505516

Predicting the next Point-of-Interest (POI) is crucial for location-based services. In this paper, we propose the Time-enhanced Sequence Prediction Model (TSPM) to improve the accuracy of next POI recommendations by incorporating temporal information and dynamic graph *** approach utilizes a Time-enhanced Sequence-based Dynamic Graph (TSDG) that captures both temporal transitions of POIs and sequential dependencies in user behavior. By embedding temporal information directly into the graph structure, TSPM effectively models user movements. We further enhance POI embeddings using knowledge graph techniques and Eigenmap to preserve the topological properties of the *** proposed model integrates these enriched embeddings into a Time-aware Recurrent Neural Network (TiRNN) to capture the influence of past check-ins across different time intervals. Experiments on real-world datasets demonstrate that TSPM significantly outperforms existing methods in prediction accuracy. © 2024 IEEE.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

IEARACDA: Predicting circRNA-disease associations based on information enhancement and arctangent rank approximation

IEARACDA: Predicting circRNA-disease associations based on i...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Pang, Shanchen Song, Zheqi Liu, Tiyao Wu, Wenhao Zhang, Yuanyuan Wang, Shudong College of Computer Science and Technology Qingdao Institute of Software Qingdao China Qingdao University of Technology School of Information and Control Engineering Qingdao China

ISBN: (纸本)9798350386226

Circular RNAs (circRNAs) are non-coding RNA molecules that play a significant role in cell regulation and disease occurrence. In recent years, the use of computational methods to predict circRNAs associated with diseases has become a research focus. However, these methods are often constrained by the noise interference and an insufficient exploration of the underlying information in known associations. Therefore, this paper proposes an information enhancement and arctangent rank approximation based method to predict potential circRNA-disease associations (IEARACDA). Firstly, information enhancement methods are used to make circRNA and disease similarity information more complete and to reduce the sparsity of known association. Subsequently, the arctangent rank approximation method is employed to mitigate the potential bias issues that may arise from the nuclear norm, and optimization is carried out using the inexact augmented Lagrange multiplier (IALM) method. Finally, potential associations are predicted through heterogeneous graph inference method. The experimental results demonstrate that IEARACDA exhibits superior performance compared to existing methods. Furthermore, case studies for hepatocellular carcinoma and lung cancer provide additional confirmation of the accuracy and practical significance of the model predictions. © 2024 IEEE.

关键词： Lung cancer

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning-Based Scheduling Algorithm for Service Differentiation in Cloud Business Process Management System 17th

Deep Reinforcement Learning-Based Scheduling Algorithm for ...

引用

17th CCF Conference on computer Supported Cooperative Work and Social Computing, ChineseCSCW 2022

作者： Wu, Yunzhi Yu, Yang Pan, Maolin School of Computer Science and Engineering Sun Yat-sen University Guangzhou China School of Software Engineering Sun Yat-sen University Guangzhou China

ISBN: (纸本)9789819923847

Business process management system in cloud is increasingly used in enterprise organizations for its advantages of flexibility, affordability, and usability. The service differentiation problem for cloud business process management system has not been thoroughly investigated, nevertheless. Service differentiation requires corresponding service quality for different service level agreements. To address this problem, this paper designs a scheduling system in cloud business process management system by combining characteristics of the workflow engine, models the request scheduling process as the Markov decision process, and proposes a request scheduling algorithm for service differentiation in cloud business process management system based on deep reinforcement learning. The algorithm effectively reduces the over-provisioning of service quality while maintaining a low service level agreement violation rate, thus enhancing the service differentiation effect and conserving system resources. Experiments illustrate that the algorithm achieves a better service differentiation effect with a 74.4% drop rate in service quality over-provisioning compared to the heuristic algorithm while maintaining the service level agreement violation rate within 5%. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Expression Recognition and Intelligent Classroom State Mining in Teaching Videos Based on Semi-Supervised Learning Generative Adversarial Network 5

Expression Recognition and Intelligent Classroom State Minin...

引用

5th International Conference on Data-Driven Optimization of Complex Systems, DOCS 2023

作者： Fan, Ruoyu Liang, Meiyu Yin, Mengran Du, Junping Multimedia School of Computer Science National Pilot Software Engineering School Beijing University of Posts and Telecommunications Beijing Key Laboratory of Intelligent Communication Software Beijing China

ISBN: (纸本)9798350393521

We constructed a student classroom teaching video dataset, constructed a student classroom expression dataset through video frame extraction, face detection, face alignment, and facial extraction, and constructed a student classroom behavior dataset through object detection algorithm. Aiming at the characteristics that the annotation information of the students' classroom expression dataset constructed in this paper is limited and the data of some categories are less, an expression recognition method based on semi-supervised learning generative adversarial network (SSLGAN) is proposed. The problem of limited annotation information is solved through semi-supervised learning, and the problem of less data of some categories is solved through data enhancement of generative adversarial network. An intelligent classroom state mining method that integrates student expressions and behaviors has been proposed, achieving intelligent classroom state mining of teaching videos and automatic evaluation of classroom listening status for individual and overall students in different types of classrooms, such as interactive classes, discussion classes, and self-study classes. Compared with CNN, RMN, Temporal Ensembling and Mean Teacher, the proposed SSLGAN has achieved the highest accuracy in the benchmark dataset FER2013, JAFFE, RaFD and self-built student classroom expression dataset. In the case where there are few labels in the self-built student classroom expression dataset, the accuracy of student expression recognition results still reaches 76%, and the proposed intelligent classroom state mining method that integrates student expressions and behaviors for different types of classrooms also has high accuracy on the self-built student classroom teaching video dataset. © 2023 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Optimal Bounds for Distinct Quartics 51

Optimal Bounds for Distinct Quartics

引用

51st International Colloquium on Automata, Languages, and Programming, ICALP 2024

作者： Charalampopoulos, Panagiotis Gawrychowski, Pawel Ghazawi, Samah School of Computing and Mathematical Sciences Birkbeck University of London United Kingdom Institute of Computer Science University of Wroclaw Poland Department of Computer Science University of Haifa Israel Department of Software Engineering Braude College of Engineering Karmiel Israel

ISBN: (纸本)9783959773225

A fundamental concept related to strings is that of repetitions. It has been extensively studied in many versions, from both purely combinatorial and algorithmic angles. One of the most basic questions is how many distinct squares, i.e., distinct strings of the form UU, a string of length n can contain as fragments. It turns out that this is always O(n), and the bound cannot be improved to sublinear in n [Fraenkel and Simpson, JCTA 1998]. Several similar questions about repetitions in strings have been considered, and by now we seem to have a good understanding of their repetitive structure. For higher-dimensional strings, the basic concept of periodicity has been successfully extended and applied to design efficient algorithms – it is inherently more complex than for regular strings. Extending the notion of repetitions and understanding the repetitive structure of higher-dimensional strings is however far from complete. Quartics were introduced by Apostolico and Brimkov [TCS 2000] as analogues of squares in two dimensions. Charalampopoulos, Radoszewski, Rytter, Waleń, and Zuba [ESA 2020] proved that the number of distinct quartics in an n × n 2D string is O(n2 log2 n) and that they can be computed in O(n2 log2 n) time. Gawrychowski, Ghazawi, and Landau [SPIRE 2021] constructed an infinite family of n × n 2D strings with Ω(n2 log n) distinct quartics. This brings the challenge of determining asymptotically tight bounds. Here, we settle both the combinatorial and the algorithmic aspects of this question: the number of distinct quartics in an n × n 2D string is O(n2 log n) and they can be computed in the worst-case optimal O(n2 log n) time. As expected, our solution heavily exploits the periodic structure implied by occurrences of quartics. However, the two-dimensional nature of the problem introduces some technical challenges. Somewhat surprisingly, we overcome the final challenge for the combinatorial bound using a result of Marcus and Tardos [JCTA 2004] for permuta

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Small Object Detection in Aerial Drone Imagery based on YOLOv8

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer science 2024年第9期51卷 1346-1354页

作者： Pan, Junyu Zhang, Yujun School of Computer Science and Software Engineering University of Science and Technology Liaoning Anshan114051 China School of Computer Science and Software Engineering University of Science and Technology Liaoning Anshan114051 China

In recent years, the utilization of unmanned aerial vehicles (UAVs) for aerial target detection has gained significant attention due to their high-altitude perspective and maneuverability, which offer novel opportunities and tremendous potential in this field. However, detecting targets in UAV aerial images remains highly challenging due to the presence of numerous small targets with limited feature information, as well as issues like target occlusion and complex backgrounds that severely impact detection accuracy. To address these challenges, we propose a detection model called BDC-YOLOv8 that aims to enhance accuracy for small targets while minimizing computational complexity. Specifically, we augment the YOLOv8 architecture by incorporating a dedicated detection head tailored for small targets to improve performance when encountering such objects. Additionally, we restructure the neck network of the model to better extract and fuse feature information from targets with significant scale variations. Furthermore, we introduce the concept of DynamicHead to enhance the detection head by incorporating various attention mechanisms suitable for our task ahead of the original detection head, thereby enhancing the model’s capability to detect objects of different scales and complex backgrounds. Moreover, we introduce Convolutional Block Attention Module (CBAM) to identify regions of interest in densely populated areas. Extensive experiments conducted on the VisDrone2019 dataset yield promising results where our model achieves a mean Average Precision (mAP) score of 38% and an AP50 score of 59.6%. Compared to the original YOLOV8 model, improvements are observed with increases in mAP by 2.5% and AP50 by 3.7%, respectively. Notably, our model demonstrates a significant enhancement in detecting small targets with an increase in APs evaluation metric by 4.1%. © (2024), (International Association of Engineers). All Rights Reserved.

关键词： Aerial photography

来源：评论

学校读者我要写书评

暂无评论

Time Series Data Cleaning under Expressive Constraints on Both Rows and Columns 40

Time Series Data Cleaning under Expressive Constraints on Bo...

引用

40th IEEE International Conference on Data engineering, ICDE 2024

作者： Ding, Xiaoou Li, Genglong Wang, Hongzhi Wang, Chen Song, Yichen School of Computer Science and Technology Harbin Institute of Technology China Tsinghua University National Engineering Laboratory for Big Data Software EIRI China

ISBN: (纸本)9798350317152

Time series data generated by thousands of sensors are suffering data quality problems. Traditional constraint-based techniques have greatly contributed to data cleaning applications. However, cleaning methods that support expressive constraints on time series data remain insufficient. Given the notable characteristics of time series data, existing cleaning approaches are challenged to provide good repair solutions. To address the challenges, we propose a novel data cleaning method for time series which incorporates expressive constraints that support arithmetic operations between attributes and time context. In the violation detection phase, we introduce specialized violation degree quantification functions and design a violation cell discovery algorithm to identify errors hidden in time series data. In the data repairing phase, we formalize the cleaning task as a constrained optimization problem and develop a novel repair objective function that considers both modification costs and conformance degrees of constraints. We effectively reduce the repair search space through the evaluation of time-context constraints and propose a bidirectional repairing algorithm. We also provide theoretical analysis of the proposed repairing method. Experimental results on three real-world IoT datasets across five metrics demonstrate that our proposed method outperforms seven state-of-the-art cleaning techniques specialized for time series data. Specifically, we achieve a 60% improvement in repairing effectiveness and a 70% reduction in time costs with our designed cleaning strategy. © 2024 IEEE.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

引用

25th International Conference on Web Information Systems engineering, WISE 2024

作者： Tu, Longchuan Meng, Shunmei Liu, Xiao Liu, Guanfeng Beheshti, Amin Zhang, Xuyun School of Computer Science and Engineering Nanjing University of Science and Technology Nanjin China State Key Laboratory for Novel Software Technology Nanjing University Nanjin China School of Computing Macquarie University Sydney Australia

ISBN: (纸本)9789819605699

Recently, graph neural networks(GNNs) have played a key crucial in many recommendation situations. In particular, contrastive learning-based hypergraph neural networks (HGNNs) are gradually becoming a research focus for addressing issues of data sparsity and noise. Despite many studies proving their outstanding performance, there are still some shortcomings: i) Most contrastive learning-based HGNNs primarily rely on cross-view contrastive learning, while neglecting contrastive learning on the interaction graph. ii) Utilizing node embedding for hypergraph structure learning is susceptible to the influence of low-quality representations, thereby constraining the learning capability of HGNNs. To address these issues, we offer a Semantic Similarity-based Graph Contrastive Learning framework (SSGCL), which aims to jointly learn representations with rich semantic information through within-view and cross-view contrastive learning. Specifically, we first introduce consistency contrastive learning, which captures self-supervised signals through semantic similarity between nodes and their neighborhoods. It better captures the unique features of nodes through the connections between nodes and their neighborhoods. Then, we utilize interaction graph learning hypergraph structure, promoting it to extract potential node connections and thus improving its ability to describe homogeneous node relationships. Experimental evaluations on three actual datasets show that SSGCL performs much better than the current baseline models. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A novel transformer-based graph generation model for vectorized road design

A novel transformer-based graph generation model for vectori...

引用

作者： Zhou, Peichi Li, Chen Zhang, Jian Wang, Changbo Qin, Hong Liu, Long School of Software Engineering East China Normal University Shanghai China School of Computer Science and Technology East China Normal University Shanghai China Department of Computer Science StonyBrook University Stony BrookNY United States

Road network design, as an important part of landscape modeling, shows a great significance in automatic driving, video game development, and disaster simulation. To date, this task remains labor-intensive, tedious and time-consuming. Many improved techniques have been proposed during the last two decades. Nevertheless, most of the state-of-the-art methods still encounter problems of intuitiveness, usefulness and/or interactivity. As a rapid deviation from the conventional road design, this paper advocates an improved road modeling framework for automatic and interactive road production driven by geographical maps (including elevation, water, vegetation maps). Our method integrates the capability of flexible image generation models with powerful transformer architecture to afford a vectorized road network. We firstly construct a dataset that includes road graphs, density map and their corresponding geographical maps. Secondly, we develop a density map generation network based on image translation model with an attention mechanism to predict a road density map. The usage of density map facilitates faster convergence and better performance, which also serves as the input for road graph generation. Thirdly, we employ the transformer architecture to evolve density maps to road graphs. Our comprehensive experimental results have verified the efficiency, robustness and applicability of our newly-proposed framework for road design. © 2024 John Wiley & Sons Ltd.

关键词： Roads and streets

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：