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

27th International Conference on Pattern Recognition, ICPR 2024

作者： Jad, Sarah Torki, Marwan Khalafallah, Ayman Computer and Systems Engineering Department Alexandria University Alexandria Egypt

ISBN: (纸本)9783031784552

Crowd counting problem is a challenging task in computer vision and image analysis. It has many applications in the real world such as crowd management, public safety, and urban planning. Our proposal in this paper is a mask-aware transformer-based network for crowd counting that uses the background/foreground mask information to improve density regression accuracy. Our backbone network is a pyramid vision transformer. Our proposed Mask-aware transformer (M-Trans) takes into consideration the background/foreground mask information. We further improve the performance by applying a greedy ensemble strategy. Our experimental evaluation shows that our mask-aware network achieves state-of-the-art performance on standard benchmarking datasets for crowd counting such as ShanghaiTech and UCF-QNRF datasets. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Urban planning

来源：评论

学校读者我要写书评

暂无评论

Bridging the Digital Divide with FANETs: Toolset for Optimized Microservices Deployment 28

Bridging the Digital Divide with FANETs: Toolset for Optimiz...

引用

28th Conference on Innovation in Clouds, Internet and Networks, ICIN 2025

作者： García-Gil, Santiago García-López, Andrés Frejo-Martín, Sergio Murillo, Juan Manuel Galán-Jiménez, Jaime Department of Computer Systems and Telematics Engineering University of Extremadura Spain

ISBN: (纸本)9798331542399

Closing the connectivity gap between rural and urban areas is a challenging task. However, it is an excellent opportunity for digital innovation and for boosting the development and implementation of new networking technologies. In this demo proposal, we introduce two software utilities that, when used in conjunction, ease the design and evaluation of networking scenarios based on Flying Ad Hoc Networks (FANETs). They also allow the implementation and application of multiple optimization techniques to solve the microservices deployment problem for MSA-based applications in UAV networks. The evaluation of such deployments of MSA-based applications is addressed under a network emulator. Both software tools aim to provide a framework to improve the Quality of Service (QoS) of Unmanned Aerial Vehicles (UAV) based networks that allows the network operator to choose (and compare) the best method for each situation. © 2025 IEEE.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Generalized Regenerating Codes and Node Repair on Graphs

引用

IEEE Transactions on Information Theory 2025年第3期71卷 1613-1630页

作者： Patra, Adway Barg, Alexander University of Maryland Department of Electrical and Computer Engineering The Institute for Systems Research College ParkMD20742 United States

We consider regenerating codes in distributed storage systems where connections between the nodes are constrained by a graph. In this problem, the failed node downloads the information stored at a subset of vertices of the graph for the purpose of recovering the lost data. Compared to the standard setting, regenerating codes on graphs address two additional features. The repair information is moved across the network, and the cost of node repair is determined by the graphical distance from the helper nodes to the failed node. Accordingly, the helpers far away from the failed node may be expected to contribute less data for repair than the nodes in the neighborhood of that node. We analyze regenerating codes with nonuniform download for repair on graphs. Moreover, in the process of repair, the information moved from the helpers to the failed node may be combined through intermediate processing, reducing the repair bandwidth. We derive lower bounds for communication complexity of node repair on graphs, including repair schemes with nonuniform download and intermediate processing, and construct codes that attain these bounds. Additionally, some of the nodes may act as adversaries, introducing errors into the data moved in the network. For repair on graphs in the presence of adversarial nodes, we construct codes that support node repair and error correction in systematic nodes. © 1963-2012 IEEE.

关键词： Maintenance engineering Codes Costs Network coding IP networks Bandwidth Symbols Encoding Vectors Standards

来源：评论

学校读者我要写书评

暂无评论

Performance *** Comparative Analysis of Multimodal Bilinear Pooling Fusion Approaches for Deep Learning-Based Visual Arabic-Question Answering systems

引用

computer Modeling in engineering & Sciences 2025年第4期143卷 373-411页

作者： Sarah M.Kamel Mai A.Fadel Lamiaa Elrefaei Shimaa I.Hassan Electrical Engineering Department Faculty of Engineering at ShoubraBenha UniversityCairo11629Egypt Computer Science Department Faculty of Computing and Information TechnologyKing Abdulaziz UniversityJeddah21589Saudi Arabia Department of Computer and Systems Engineering Faculty of Engineering and TechnologyBadr University in Cairo(BUC)Cairo11829Egypt Communication Systems Engineering Department Faculty of EngineeringBenha National UniversityObour11846QalyubiaEgypt

Visual question answering(VQA)is a multimodal task,involving a deep understanding of the image scene and the question’s meaning and capturing the relevant correlations between both modalities to infer the appropriate *** this paper,we propose a VQA system intended to answer yes/no questions about real-world images,in *** support a robust VQA system,we work in two directions:(1)Using deep neural networks to semantically represent the given image and question in a fine-grainedmanner,namely ResNet-152 and Gated Recurrent Units(GRU).(2)Studying the role of the utilizedmultimodal bilinear pooling fusion technique in the *** the model complexity and the overall model *** fusion techniques could significantly increase the model complexity,which seriously limits their applicability for VQA *** far,there is no evidence of how efficient these multimodal bilinear pooling fusion techniques are for VQA systems dedicated to yes/no ***,a comparative analysis is conducted between eight bilinear pooling fusion techniques,in terms of their ability to reduce themodel complexity and improve themodel performance in this case of VQA *** indicate that these multimodal bilinear pooling fusion techniques have improved the VQA model’s performance,until reaching the best performance of 89.25%.Further,experiments have proven that the number of answers in the developed VQA system is a critical factor that *** the effectiveness of these multimodal bilinear pooling techniques in achieving their main objective of reducing the model *** Multimodal Local Perception Bilinear Pooling(MLPB)technique has shown the best balance between the model complexity and its performance,for VQA systems designed to answer yes/no questions.

关键词： Arabic-VQA deep learning-based VQA deep multimodal information fusion multimodal representation learning VQA of yes/no questions VQA model complexity VQA model performance performance-complexity trade-off

来源：评论

学校读者我要写书评

暂无评论

Reliable Task Offloading for 6G-Based IoT Applications

引用

computers, Materials & Continua 2025年第2期82卷 2255-2274页

作者： Usman Mahmood Malik Muhammad Awais Javed Ahmad Naseem Alvi Mohammed Alkhathami Department of Computer Software Engineering National University of Science and Technology(NUST)Islamabad44000Pakistan Department of Electrical and Computer Engineering COMSATS University IslamabadIslamabad45550Pakistan Information Systems Department College of Computer and Information SciencesImam Mohammad Ibn Saud Islamic University(IMSIU)Riyadh11432Saudi Arabia

Fog computing is a key enabling technology of 6G systems as it provides quick and reliable computing,and data storage services which are required for several 6G *** Intelligence(AI)algorithms will be an integral part of 6G systems and efficient task offloading techniques using fog computing will improve their performance and *** this paper,the focus is on the scenario of Partial Offloading of a Task to Multiple Helpers(POMH)in which larger tasks are divided into smaller subtasks and processed in parallel,hence expediting task ***,using POMH presents challenges such as breaking tasks into subtasks and scaling these subtasks based on many interdependent factors to ensure that all subtasks of a task finish simultaneously,preventing resource ***,applying matching theory to POMH scenarios results in dynamic preference profiles of helping devices due to changing subtask sizes,resulting in a difficult-to-solve,externalities *** paper introduces a novel many-to-one matching-based algorithm,designed to address the externalities problem and optimize resource allocation within POMH ***,we propose a new time-efficient preference profiling technique that further enhances time optimization in POMH *** performance of the proposed technique is thoroughly evaluated in comparison to alternate baseline schemes,revealing many advantages of the proposed *** simulation findings indisputably show that the proposed matching-based offloading technique outperforms existing methodologies in the literature,yielding a remarkable 52 reduction in task latency,particularly under high workloads.

关键词： 6G IoT task offloading fog computing

来源：评论

学校读者我要写书评

暂无评论

Automated face recognition using deep learning technique and center symmetric multivariant local binary pattern

引用

Neural Computing and Applications 2025年第1期37卷 263-281页

作者： Sekhar, J.C. Josephson, P. Joel Chinnasamy, A. Maheswari, M. Sankar, S. Kalangi, Ruth Ramya Department of Computer Science and Engineering NRI Institute of Technology Andhra Pradesh Guntur India Department of Electronics and Communication Engineering Malla Reddy Engineering College Telangana Hyderabad India Department of Data Science and Business Systems School of Computing SRMIST Kattankulathur Chennai India Department of Computer Science and Engineering Panimalar Engineering College Chennai India Department of Computer Science and Engineering Saveetha School of Engineering SIMATS Chennai India Department of Computer Science and Engineering Koneru Lakshmaiah Education Foundation Andhra Pradesh Vijayawada India

Researchers have recently created several deep learning strategies for various tasks, and facial recognition has made remarkable progress in employing these techniques. Face recognition is a noncontact, nonobligatory, acceptable, and harmonious biometric recognition method with a promising national and social security future. The purpose of this paper is to improve the existing face recognition algorithm, investigate extensive data-driven face recognition methods, and propose a unique automated face recognition methodology based on generative adversarial networks (GANs) and the center symmetric multivariable local binary pattern (CS-MLBP). To begin, this paper employs the center symmetric multivariant local binary pattern (CS-MLBP) algorithm to extract the texture features of the face, addressing the issue that C2DPCA (column-based two-dimensional principle component analysis) does an excellent job of removing the global characteristics of the face but struggles to process the local features of the face under large samples. The extracted texture features are combined with the international features retrieved using C2DPCA to generate a multifeatured face. The proposed method, GAN-CS-MLBP, syndicates the power of GAN with the robustness of CS-MLBP, resulting in an accurate and efficient face recognition system. Deep learning algorithms, mainly neural networks, automatically extract discriminative properties from facial images. The learned features capture low-level information and high-level meanings, permitting the model to distinguish among dissimilar persons more successfully. To assess the proposed technique’s GAN-CS-MLBP performance, extensive experiments are performed on benchmark face recognition datasets such as LFW, YTF, and CASIA-WebFace. Giving to the findings, our method exceeds state-of-the-art facial recognition systems in terms of recognition accuracy and resilience. The proposed automatic face recognition system GAN-CS-MLBP provides a solid basis for a

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Distributed Attention-Enabled Multi-Agent Reinforcement Learning Based Frequency Regulation of Power systems

引用

IEEE Transactions on Power systems 2025年第3期40卷 2427-2437页

作者： Zhao, Yunzheng Liu, Tao Hill, David J. University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong Hong Kong Monash University Department of Electrical and Computer Systems Engineering ClaytonVIC3800 Australia

This paper develops a new distributed attention-enabled multi-agent reinforcement learning method for frequency regulation of power systems. Specifically, the controller of each generator is modelled as an agent, and the reward and observation are designed based on the characteristics of power systems. All the agents learn their own control policies in the offline training phase and generate frequency control signals in the online execution phase. The target of the proposed algorithm is to conduct both offline training and online frequency control in a distributed way. To achieve this goal, two distributed information-sharing mechanisms are proposed based on the different global information to be discovered. First, a consensus-based reward-sharing mechanism is designed to estimate the globally averaged reward. Second, a distributed observation-sharing scheme is developed to discover the global observation information. Furthermore, the attention strategy is embedded in the observation-sharing scheme to help agents adaptively adjust the importance of observations from different neighbors. With these two mechanisms, a new distributed attention-enabled proximal policy optimization (DAPPO) based method is proposed to achieve model-free frequency control. Simulation results on the IEEE 39-bus system and the NPCC 140-bus system demonstrate that the proposed DAPPO achieves stable offline training and effective online frequency control. © 1969-2012 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Latency Bounds for TSN Scheduling in the Presence of Clock Synchronization

IEEE Networking Letters

引用

IEEE Networking Letters 2025年第1期7卷 41-45页

作者： Ghosh, Aviroop Yousefi, Saleh Kunz, Thomas Carleton University Department of Systems and Computer Engineering OttawaONK1S 5B6 Canada Urmia University Department of Electrical and Computer Engineering Urmia57561-51818 Iran

The IEEE 802.1Qbv (80.21Qbv) standard is designed for traffic requiring deterministic and bounded latencies through strict periodic time synchronization, as specified by IEEE 802.1AS standard. However, internal clock drift in devices causes timing misalignment, introducing further challenges to 802.1Qbv scheduling. Existing solutions, using either complex optimization approaches or non-trivial scheduling heuristics, address this by scheduling frame transmissions only once they are guaranteed to have been fully received, even in the presence of clock drifts. However, this approach introduces additional delays that can impact deadline requirements. This letter analytically derives tight end-to-end latency bounds, allowing us to determine if stream deadlines for a given network will be violated without the need to solve for any scheduling algorithms. It also proposes an approach that results in tighter bounds based on information collected from the synchronization process. The analytical results are compared with simulation results, confirming their validity. © 2019 IEEE.

关键词： Synchronization Clocks Delays Standards Schedules Logic gates Scheduling algorithms Payloads Jitter Data models

来源：评论

学校读者我要写书评

暂无评论

IMPROVEMENT OF THE ACO ALGORITHM FOR INTELLIGENT TASK SCHEDULING IN CLOUD systems

引用

Scalable Computing 2025年第2期26卷 531-539页

作者： DJEBBAR, ESMA INSAF BELALEM, GHALEM Department of Computer Science Systems Engineering National Polytechnic School of Oran-Maurie Audin Oran Algeria Department of Computer Science University of Oran1-Ahmed Ben Bella Algeria

Cloud computing involves accessing and using computing resources, such as servers, storage, and software applications, over the Internet, enabling scalable access on demand. Cloud computing systems are becoming an essential platform for scientific applications. They enable task scheduling and IT resource allocation. When these resources are not enough to meet demand, planning techniques are necessary. We propose to apply an improved ACO algorithm for intelligent task scheduling and appropriate resource allocation in a cloud environment. This work proposes a modified version of the ACO algorithm that can quickly converge to the best solution to further optimize the total response time, the average response time and the total execution cost. The algorithm suggested based on artificial intelligence application of enhanced ACO is compared with the classical ACO algorithm using Cloudsim simulator. The results obtained after the experiments and simulation are very encouraging to adopt this technique. © (2025), (West University of Timisoara). All rights reserved.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

Author profiling from Romanized Urdu text using transfer learning models

引用

Neural Computing and Applications 2025年第6期37卷 4455-4470页

作者： Ali, Abid khan, Muhammad Sohail Khan, Muhammad Amin Khan, Sajid Ullah Khan, Faheem Department of Computer Software Engineering University of Engineering & Technology Mardan KPK Mardan23200 Pakistan Islamabad H-11/4 Islamabad44000 Pakistan Department of Information Systems College of Computer Engineering and Sciences Prince Sattam Bin Abdulaziz University Al-Kharj Saudi Arabia Department of Computer Engineering Gachon University Seongnam-Si Korea Republic of

This research concentrates on author profiling using transfer learning models for classifying age and gender. The investigation encompassed a diverse set of transfer learning techniques, including Roberta, BERT, ALBERT, Distil BERT, Distil Roberta, ELECTRA, and XLNet. Through meticulous evaluation using metrics such as the Matthews Correlation Coefficient, Accuracy, Precision, Recall, and F1 Score, the study examined the efficacy of these models. The curated dataset was divided for gender and age tasks, resulting in robust gender prediction with the XLNet model and age prediction with the BERT model. Notably, the XLNet model achieved the highest MCC (0.7946), Accuracy (0.8957), Precision (0.8992), Recall (0.8957), and F1 Score (0.8958) values in gender classification, while the BERT model excelled in age prediction with an MCC of (0.7338), Accuracy of (0.8220), Precision of (0.8324), Recall of (0.8220), and F1 Score of (0.8243). Visualized outcomes provide valuable insights into the model’s performance nuances, paving the way for their practical implementation. This research offers novel contributions to author profiling tasks, bridging the gap between theory and real-world applications. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：