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

11th International Conference on Vehicle technology and Intelligent Transport Systems, VEHITS 2025

作者： Li, Zhijuan Wu, Xintong Li, Xiaokun Ma, Xiaomin Department of Computer and Big Data Heilongjiang University Harbin150080 China Postdoctoral Program of Heilongjiang Hengxun Technology Co. Ltd. Harbin150090 China School of Computer Science and Technology Harbin Institute of Technology Harbin150001 China College of Science and Engineering Oral Roberts University TulsaOK74171 United States

ISBN: (纸本)9789897587450

Interference is a critical factor that degrades wireless network performance. In IEEE 802.11 wireless broadcast networks, hidden terminals and concurrent transmissions are the primary sources of interference due to the carrier sense multiple access (CSMA) mechanism. Therefore, analyzing the signal-to-interference-plus-noise ratio (SINR) distribution is essential for evaluating network performance, whose derivation relates to the transmission probabilities of hidden terminals and concurrent transmissions. In this study, we utilize the existing semi-markov process (SMP) model to calculate these transmission probabilities. Subsequently, we employ the Laplace transform to analyze the SINR distribution in IEEE 802.11 broadcast ad-hoc networks on highways. Based on the derived SINR distribution, we further evaluate the reliability and capacity. This approach can be readily extended to two-dimensional (2D) or three-dimensional (3D) scenarios by employing d-dimensional (1 ≤ d ≤ 3, dD) point process. Experimental results demonstrate that the proposed model achieves high accuracy under small to medium interference ranges. Additionally, the analysis remains highly accurate for receivers within 70 meters, even in scenarios with large interference ranges. Copyright © 2025 by SCITEPRESS - science and technology Publications, Lda.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

A novel dominating set and centrality based graph convolutional network for node classification

引用

Multimedia Tools and Applications 2025年第14期84卷 12979-13004页

作者： Garg, Neeraj Garg, Sneha Jadeja, Mahipal Meena, Yogesh Kumar Gopalani, Dinesh Chauhan, Ganpat Singh Department of Computer Science and Engineering Malaviya National Institute of Technology Jaipur Rajasthan Jaipur302017 India Department of Computer Science and Engineering Swami Keshvanand Institute of Technology Jaipur Rajasthan Jaipur302017 India Department of Information Technology School of IT Manipal University Jaipur Rajasthan Jaipur302034 India

To learn and analyze graph-structured data, Graph Neural Networks (GNNs) have emerged as a powerful framework over traditional neural networks, which work well on grid-like or sequential structure data. GNNs are particularly designed to record dependencies and relations in large and complicated networks such as social networks, molecular structures, citation networks and recommendation systems. The main idea behind GNN is the message-passing mechanism that allows sharing of information between nodes and edges in a graph network, enabling the model to learn about graph structures and perform well even with limited training data. GNNs have three different architectures: Graph Convolutional Network (GCN), GraphSAGE, Graph Attention Model (GAT) and other hybrid models. In this paper, we have proposed novel GCN models namely dominating Set with Degree Centrality based GCN (DS_DC_GCN) and dominating Set with Betweenness Centrality based GCN (DS_BWC_GCN) model, for node classification task. In the traditional GNN models, training nodes are selected randomly. In our proposed models, we first identify a subset of the nodes with the help of a dominating set (D) of the underlying network. Then we consider final training nodes (say D′) from set D based on the centrality scores (degree or betweenness). We give preference to nodes having high centrality scores for training. To evaluate the performance of the proposed models, we have used three standard citation network datasets - Cora, Citeseer and Pubmed. Our models obtain improved node classification performance as compared to other state-of-the-art-methods. The consideration of high centrality nodes of dominating set in training helps to improve the feature availability in the underlying computational graphs, which in turn improves learning and hence, model performance. These models also have the potential to offer better results for other network tasks, including link prediction and community detection. © The Author(s), under

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Air quality and dust level monitoring systems in hospitals using IoT

引用

Discover Internet of Things 2025年第1期5卷 1-18页

作者： Parkavi, A. Sowmya, B.J. Alex, Sini Anna Supreeth, S. Shruthi, G. Rohith, S. Chatterjee, Sudipta Lingaraj, K. Department of Computer Science and Engineering Ramaiah Institute of Technology Bengaluru560054 India Department of Artificial Intelligence and Data Science Ramaiah Institute of Technology Bengaluru560054 India Ramaiah Institute of Technology Bengaluru560054 India School of Computer Science and Engineering REVA University Bengaluru560064 India Department of Electronics and Communication Engineering Nagarjuna College of Engineering and Technology Bengaluru562164 India Department of Electronics and Communication Engineering Brainware University Barasat West Bengal Kolkata700125 India Department of Computer Science and Engineering Rao Bahadur Y. Mahabaleswarappa Engineering College Bellary583104 India

This system provides a comprehensive overview of hospital environments by tracking air quality, dust, temperature, and humidity simultaneously, offering a more complete picture of indoor conditions than systems that focus on fewer parameters. The use of IoT technology enables real-time monitoring and alerts, allowing hospital staff to respond immediately to any issues. Additionally, predictive analytics anticipate future changes, giving staff time to take preventive measures. The integration with a mobile app and cloud-based data storage ensures easy access to data, convenient monitoring, and the ability to scale the system across multiple hospital facilities, catering specifically to the unique needs of different healthcare environments. © The Author(s) 2025.

关键词： Indoor air pollution

来源：评论

学校读者我要写书评

暂无评论

REGAC: Multi-Class Offensive Content Identification Using Graphical Approach

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer science 2025年第4期52卷 931-952页

作者： Chinivar, Sneha Roopa, M.S. Arunalatha, J.S. Venugopal, K.R. Department of Computer Science and Engineering Bangalore University K R Circle Karnataka Bengaluru India Department of Computer Science and Engineering Nitte Meenakshi Institute of Technology Karnataka Bengaluru India Department of Computer Science and Engineering Bangalore University K R Circle Karnataka Bengaluru India Karnataka Bengaluru India

Online offensive behaviour continues to rise with the increasing popularity and use of social media. Various techniques have been used to address this issue. However, most existing studies consider offensive content identification as a binary or ternary problem, disregarding the potential for multi-class classification of derogatory content. In this work, we propose RoBERTa Embedding-based Graphical Approach Classifier (REGAC), which aims to designate the identified offensive content into varied classes,like age, gender, ethnicity, religion, and others to understand what exact qualities the bully usually targets in their victim so that pertinent measures can be taken to battle them. Additionally, the models’ efficiency is evaluated using an unbalanced dataset to identify types of offensive content. The word embeddings are generated for a balanced dataset using RoBERTa embedding model to bring out the best-fitting vectors. These vectors are then input into traditional Machine Learning algorithms (SVM, KNN, Logistic Regression, Random Forest, and XGBoost) and graph-based algorithms (Graph Convolution Network (GCN), GraphSAGE, and Graph Attention Network (GAT)) for fine-grained categorization of offensive textual content. The experimental results demonstrate the efficiency of combating social media’s offensive content of the proposed work with higher Precision, Recall, F1-Score, and Accuracy compared with most state-of-art approaches. © (2025.0), (International Association of Engineers). All Rights Reserved.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

Application of adaptive guard channel reservation under hard handoff constraint in wireless cellular network

引用

International Journal of Wireless and Mobile Computing 2025年第2期28卷 170-185页

作者： Sahu, Promod Kumar Pati, Hemanta Kumar Pradha, Sateesh Kumar Department of Computer Science and Application Utkal University Vani Vihar Odisha Bhubaneswar India Department of Computer Science and Engineering International Institute of Information Technology Bhubaneswar Odisha Bhubaneswar India

Voice is the king of communication in wireless cellular network (WCN). Again, WCNs provide two types of calls, i.e., new call (NC) and handoff call (HC). Generally, HCs have higher priority than NCs because call dropping gives negative impact to users as compared to call blocking. So, to handle this problem some channels are reserved for HCs. If more channels are reserved for HCs, then handoff call dropping probability (HCDP) decreases at the same time as new call blocking probability (NCBP) increases;if fewer channels are reserved for HCs, HCDP increases and NCBP decreases. If channels are reserved for HCs by considering target HCDP then HCDP will be below the target and NCBP will be minimum for that target. So, keeping this in mind in this paper, we propose a mathematical model that estimates optimal number of guard channels (GCs) for HCs by considering target HCDP and keeping NCBP minimum. The mathematical model proposed assume static traffic parameters. However, in reality, the user traffic is dynamic and usually inherited through its testbed implementation. To obtain optimal performance we propose an adaptive GC reservation scheme by considering hard handoff constraint while implementing this model through testbed. Finally, we have verified testbed results with those of the model-based approach applying the parameters of different Global System for Mobile Communication (GSM) standards to evaluate its applicability to real systems. Copyright © 2025 Inderscience Enterprises Ltd.

关键词： Testbeds

来源：评论

学校读者我要写书评

暂无评论

A Novel 3D Paradigm for Target Expansion of Augmented Reality SSVEP

引用

IEEE Transactions on Neural Systems and Rehabilitation engineering 2025年 33卷 1562-1573页

作者： Cao, Beining Li-Ting Tsai, Charlie Zhou, Nan Do, Thomas Lin, Chin-Teng University of Technology Sydney Computational Intelligence and Brain-Computer Interfaces Laboratory Australian AI Institute Faculty of Engineering and Information Technology School of Computer Science UltimoNSW2007 Australia

Steady-State Visual Evoked Potentials (SSVEP) have proven to be practical in Brain-computer Interfaces (BCI), particularly when integrated with augmented reality (AR) for real-world application. However, unlike conventional computer screen-based SSVEP (CS-SSVEP), which benefits from stable experimental environments, AR-based SSVEP (AR-SSVEP) systems are susceptible to the interference of real-world environment and device instability. Particularly, the performance of AR-SSVEP significantly declines as the target frequency increases. Therefore, our study introduced a 3D paradigm that combines flicker frequency with rotation patterns as stimuli, enabling expansion of target sets without additional frequencies. In the proposed design, in addition to the conventional frequency-based SSVEP feature, bio-marker elicited by visual perception of rotation was investigated. An experimental comparison between this novel 3D paradigm and a traditional 2D approach, which increases targets by adding frequencies, reveals significant advantages. The 12-class 3D paradigm achieved an accuracy of 76.5% and an information transfer rate (ITR) of 70.42 bits/min using 1-second EEG segments. In contrast, the 2D paradigm exhibited a lower performance with 72.07% accuracy and 62.28 bits/min ITR. The result underscores the 3D paradigm’s superiority in enhancing the practical applications of SSVEP-based BCIs in AR settings, especially with shorter time windows, by effectively expanding target recognition without compromising system efficiency. © 2001-2011 IEEE.

关键词： Augmented reality

来源：评论

学校读者我要写书评

暂无评论

RaSA: Robust and Adaptive Secure Aggregation for Edge-Assisted Hierarchical Federated Learning

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 4280-4295页

作者： Wang, Lingling Huang, Mei Zhang, Zhengyin Li, Meng Wang, Jingjing Gai, Keke Qingdao University of Science and Technology School of Information Science and Technology Shandong Qingdao266061 China Hefei University of Technology School of Computer Science and Information Engineering Anhui Hefei230601 China Beijing Institute of Technology School of Cyberspace Science and Technology Beijing100081 China

Secure Aggregation (SA), in the Federated Learning (FL) setting, enables distributed clients to collaboratively learn a shared global model while keeping their raw data and local gradients private. However, when SA is implemented in edge-intelligence-driven FL, the open and heterogeneous environments will hinder model aggregation, slow down model convergence speed, and decrease model generalization ability. To address these issues, we present a Robust and adaptive Secure Aggregation (RaSA) protocol to guarantee robustness and privacy in the presence of non-IID data, heterogeneous system, and malicious edge servers. Specifically, we first design an adaptive weights updating strategy to address the non-IID data issue by considering the impact of both gradient similarity and gradient diversity on the model aggregation. Meanwhile, we enhance privacy protection by preventing privacy leakage from both gradients and aggregation weights. Different from previous work, we address system heterogeneity in the case of malicious attacks, and the malicious behavior from edge servers can be detected by the proposed verifiable approach. Moreover, we eliminate the influence of straggling communication links and dropouts on the model convergence by combining efficient product-coded computing with repetition-based secret sharing. Finally, we perform a theoretical analysis that proves the security of RaSA. Extensive experimental results show that RaSA can ensure model convergence without affecting the generalization ability under non-IID scenarios. Moreover, the decoding efficiency of RaSA achieves 1.33x and 6.4x faster than the state-of-the-art product-coded and one-dimensional coded computing schemes. © 2005-2012 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Behavioral insights into compression: a study of Move-to-Front-or-Middle deterministic online algorithm through sequence classification and characterization

引用

International Journal of Information technology (Singapore) 2025年第1期17卷 189-203页

作者： Baisakh Mohapatra, Hitesh Guru, Abhishek Department of Computer Science and Engineering Sambalpur University Institute of Information Technology Sambalpur India Computer Science and Engineering GMR Institute of Technology Andhra Pradesh Rajam India School of Computer Engineering KIIT Deemed to Be University Bhubanseswar India Department of Computer Science and Engineering Koneru Lakshmaiah Education Foundation Andhra Pradesh Vaddeswaram India

Since the list update problem was applied to data compression as an effective encoding technique, numerous deterministic algorithms have been studied and analyzed. A powerful strategy, Move-to-Front (MTF), involves moving an accessed item to the front of the list immediately. Theoretical analysis has demonstrated MTF’s potential, showing it to be 2-competitive through competitive analysis. This success has inspired researchers to develop various intriguing MTF variants and assess their performance both theoretically and experimentally. One such variant, Move-to-Front-or-Middle (MFM), has been experimentally shown that MFM performed better than the classic MTF on Calgary and Cantebury Datasets. However, the experimental performance alone does not provide sufficient insight into the internal behavior of the algorithm or explain why its performance surpasses MTF on certain datasets. Therefore, in this paper, we conduct a detailed behavioral study of MFM through sequence classification and characterization to gain deeper understanding of the algorithm and aims to reconcile the disparity between theoretical and experimental outcomes. This paper also by classifying and characterizing MFM’s performance across various request sequences, considering both the presence and absence of locality of reference. © Bharati Vidyapeeth's institute of computer Applications and Management 2024.

关键词： Competitive analysis Deterministic list update algorithm List update problem Sequence classification

来源：评论

学校读者我要写书评

暂无评论

Capacity Estimation of Li-Ion Battery Cells Using Deep Neural Networks

Capacity Estimation of Li-Ion Battery Cells Using Deep Neur...

引用

International Conference on Power engineering and Intelligent Systems, PEIS 2024

作者： Hirpara, Harshal Shah, Shail Narmawala, Zunnun Verma, Jaiprakash Computer Science and Engineering Institute of Technology Nirma University Ahmedabad India

ISBN: (纸本)9789819767090

There is an increasing demand for modern diagnostic systems for batteries in real-world operation, specifically for estimating their state of health. Online estimation of the capacity of a cell is challenging because of the dynamic nature of cell ageing and the limited parameters available from the cell under operation. Recently, data-driven capacity estimation models based on Recurrent Neural Networks (RNN) and Long Short-Term Memory (LSTM) have been developed for cells under real-world working conditions in the literature. This research incorporates LSTM-based approaches to efficiently predict the capacity estimation of the remaining battery life or the degradation time. Alterations in dataset formation using statistical approaches to boost the results are performed, proven effective with 0.0067 validation loss and the parameters tuned in the model. This can be used in the real-world by opting for a neural network approach to estimate the remaining battery life instead of manual and traditional methods, as this proves to be more fruitful and uncomplicated for applications in large industries, such as electric vehicles, cell phones, and laptops. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Lithium-ion batteries

来源：评论

学校读者我要写书评

暂无评论

A Locality-Sensitive-Hashing-Based Collaborative Recommendation Method for Responsible AI-Driven Recommender Systems

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第2期6卷 393-404页

作者： Lin, Wenmin Zhou, Xinyi Sun, Lu Qi, Lianyong Tsai, Sang-Bing Yang, Yihong Liu, Hanwen Kou, Huaizhen Kong, Lingzhen Hangzhou Normal University Alibaba Business School Hangzhou311121 China College of Computer Science and Technology Qingdao266580 China International Engineering and Technology Institute Hong Kong999077 Hong Kong China University of Geosciences School of Information Engineering Beijing100083 China Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210094 China

As one of the most representative recommendation solutions, traditional collaborative filtering (CF) models typically have limitations in dealing with large-scale, sparse data to capture complex relationships between users and items. The rise of artificial intelligence (AI) provides powerful tools such as deep neural networks to overcome the data sparsity issue with typical CF models. Existing works on AI-driven recommender systems are focusing on improving recommendation accuracy by extracting rich user/item features from multisource data with deep learning tools to build more accurate user preference model. How to ensure the responsibility of AI-driven recommender systems is still a big challenge. On one hand, AI-driven recommender systems need to access raw data such as user profiles to train recommendation model, which face the risk of leaking user privacy information. On the other hand, the ever-increasing volume of user/item interaction records raises the efficiency challenge to provide recommendation results in a real-time manner. In view of those observations, we propose a collaborative recommendation method by adopting the locality-sensitive-hashing (LSH) technique (i.e., DisRecLSH), which aims to achieve the goal of privacy protection and calculation efficiency for AI-driven recommender systems. More specifically, we split DisRecLSH into three phases: 1) offline feature extraction: deep neural networks are applied to extract user/item features from multisource user/item data on each local dataset;2) offline user index building: LSH technique is adopted to map user features to hash codes to quickly recall correlated similar users for a given target user;and 3) online top-N items calculation: with similar users selected by phase 2, top-N items are calculated based on the ranking of predicted user-item rating score. Finally, extensive experiments are conducted on three public datasets to evaluate the efficiency of our proposal. © 2020 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：