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

IEEE/ACM International Symposium on Big Data Computing (BDC)

作者： Kosei Kobayashi Masayoshi Aritsugi Pedro Henrique González Israel Mendonça Graduate School of Science and Technology Kumamoto University Kumamoto Japan Faculty of Advanced Science and Technology Kumamoto University Kumamoto Japan System Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil

ISBN: (数字)9798350367300

ISBN: (纸本)9798350367317

Wireless sensor networks are widely valued for their effectiveness in real-time data collection. As the amount of data exchanged within such networks grows, designing a robust network topology that maximizes area coverage with minimal sensors has become a critical challenge. The choice of topology impacts key network metrics, including sensor coverage, communication range, connectivity, inference, and installation and management costsIn this paper, we address the Wireless Sensor Network Planning Problem with Multiple Sources/Destinations, presenting an optimization approach based on deep reinforcement learning. This problem is noteworthy, as sensors in various applications are often required to share data within distinct destinationsWe leverage deep reinforcement learning to effectively address the complex task of selecting optimal sensor locations. Our reinforcement learning agent dynamically learns network structure by iteratively adding and removing sensors, optimizing both sensor coverage and the total number of sensors used. Experiment across diverse scenarios demonstrate the effectiveness of our method for network planning problems of varying scales, achieving full coverage with fewer sensors than traditional approaches. Additionally, our approach also produce solutions for large instances where Mixed Integer Programming solvers were not able to. Overall, our method was able to reduce the number of sensors used by up to 22.3% compared to other methods.

关键词： Measurement Integer programming Wireless sensor networks Network topology Deep reinforcement learning Real-time systems Sensors Planning Topology Optimization

来源：评论

学校读者我要写书评

暂无评论

Object Tracking by Jointly Utilizing Template Updating and Relocation Mechanisms⋆

SSRN

引用

SSRN 2023年

作者： Wen, Jia Ren, Kejun School of Information Science and Engineering Yanshan University Qinhuangdao066099 China The Key Laboratory for Computer Virtual Technology System Integration of Hebei Province China

The Siamese network-based tracker has achieved competitive performance in the field of single target tracking because of its excellent tracking speed and tracking accuracy. When faced with target deformations, most Siamese trackers rely on fixed template features from the initial frame, severely constraining the tracker’s performance. To mitigate this situation, we introduce a novel tracking framework(SiamTAR) that allows adaptive template updates based on past tracking information. In addition, we design a feature refinement module which can capture the target information more accurately at the full scale on the search image through an integrated attention mechanism, thus enabling the tracker to pay less attention to redundant information. Notably, we introduce a relocalization mechanism to solve the problems of random drift of the tracking box and inaccurate scale estimation in online tracking. Extensive experiments on GOT-10K, UAV123, OTB100 and DTB70 datasets show that the tracker achieves good tracking results and real-time performance. © 2023, The Authors. All rights reserved.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

Efficient Hyperparameter Optimization Using Deep Q-Network and BRKGA

Efficient Hyperparameter Optimization Using Deep Q-Network a...

引用

Congress on Evolutionary Computation

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

Hyperparameter optimization (HPO) is paragon to maximize performance when designing machine learning models. Among different HPO methods, Genetic Algorithm (GA) based optimization is considered effective because it allows a wide and diverse range of solutions to be explored. However, GA's exploratory nature makes this type of algorithm to evaluate many solutions that do not improve the overall performance. This is specially costly when the objective function to be evaluated is time-consuming, like in the HPO field. In this paper, we propose an efficient hybrid algorithm that is able to reduce computational cost by combining deep reinforcement learning with the Biased Random Key Genetic Algorithm (BRKGA), a variant of genetic algorithms. Our reinforcement learning agent has a decision-making role during the population's fitness calculation, in which it filters out chromosomes that would not improve the overall fitness of the population. The agent uses small amounts of pre-trained data to identify trends in potentially good solutions, and carry out its decision process. We conduct experiments on eight different datasets to assess the effectiveness of the proposed method, and the results show that the proposed method can significantly reduce the computation time of hyperparameter search using BRKGA (up to 44% reduction in computational time) without compromising the quality of the solution (no statistically difference in results).

关键词： Machine learning algorithms Filters Sociology Evolutionary computation Hyperparameter optimization Market research Linear programming

来源：评论

学校读者我要写书评

暂无评论

Preserving Location Privacy of IoT Devices in Heterogeneous Edge Computing Architecture Through Deniability-Based Authentication

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Ali, Ikram Li, Jianqiang Chen, Jie Chen, Yong Ullah, Shamsher Wakeel, Abdul Shenzhen University National Engineering Laboratory of Big Data System Computing Technology Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China University of Electronic Science and Technology of China School of Automation Engineering Chengdu611731 China National University of Sciences and Technology Military College of Signals Department of Electrical Engineering Islamabad Pakistan

Edge computing moves cloud services closer to consumer Internet of Things (IoT) devices, reducing latency and bandwidth usage. This setup enables faster responses but also introduces new security challenges, particularly concerning location privacy when sender and receiver use different security techniques. The authentication process in such architectures can expose the location of IoT devices. To address this issue, researchers have proposed various privacy-preserving schemes. However, these are computationally heavy for IoT devices. To tackle this issue, we propose two novel heterogeneous deniable authentication schemes: HDA-IoT-I and HDA-IoT-II. These schemes use public-key infrastructure and identity-based cryptography to protect the location privacy of IoT devices in heterogeneous edge computing environments. Our schemes enable the designated edge device to verify the source of a message without being able to prove its origin to a third party, thus preserving privacy. Additionally, they incorporate a batch verification method, which speeds up the verification of multiple deniable authenticators. The proposed schemes are formally proven secure in the random oracle model based on the hardness assumption of elliptic curve inverse computational Diffie-Hellman problem. The performance evaluation demonstrate that our schemes significantly enhance computational and communication efficiency, making them suitable for IoT devices. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Attention-based efficient robot grasp detection network

引用

Frontiers of Information Technology & Electronic engineering 2023年第10期24卷 1430-1444页

作者： Xiaofei QIN Wenkai HU Chen XIAO Changxiang HE Songwen PEI Xuedian ZHANG School of Optical-Electrical and Computer Engineering University of Shanghai for Science and TechnologyShanghai 200093China College of Science University of Shanghai for Science and TechnologyShanghai 200093China Shanghai Key Laboratory of Modern Optical System Shanghai 200093China Key Laboratory of Biomedical Optical Technology and Devices of Ministry of Education Shanghai 200093China Shanghai Institute of Intelligent Science and Technology Tongji UniversityShanghai 201210China

To balance the inference speed and detection accuracy of a grasp detection algorithm,which are both important for robot grasping tasks,we propose an encoder–decoder structured pixel-level grasp detection neural network named the attention-based efficient robot grasp detection network(AE-GDN).Three spatial attention modules are introduced in the encoder stages to enhance the detailed information,and three channel attention modules are introduced in the decoder stages to extract more semantic *** lightweight and efficient DenseBlocks are used to connect the encoder and decoder paths to improve the feature modeling capability of AE-GDN.A high intersection over union(IoU)value between the predicted grasp rectangle and the ground truth does not necessarily mean a high-quality grasp configuration,but might cause a *** is because traditional IoU loss calculation methods treat the center part of the predicted rectangle as having the same importance as the area around the *** design a new IoU loss calculation method based on an hourglass box matching mechanism,which will create good correspondence between high IoUs and high-quality grasp *** achieves the accuracy of 98.9%and 96.6%on the Cornell and Jacquard datasets,*** inference speed reaches 43.5 frames per second with only about 1.2×10^(6)*** proposed AE-GDN has also been deployed on a practical robotic arm grasping system and performs grasping *** are available at https://***/robvincen/robot_gradet.

关键词： Robot grasp detection Attention mechanism Encoder-decoder Neural network

来源：评论

学校读者我要写书评

暂无评论

FedMHO: Heterogeneous One-Shot Federated Learning Towards Resource-Constrained Edge Devices

arXiv

引用

arXiv 2025年

作者： Yao, Dezhong Shi, Yuexin Liu, Tongtong Xu, Zhiqiang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates

Federated Learning (FL) is increasingly adopted in edge computing scenarios, where a large number of heterogeneous clients operate under constrained or sufficient resources. The iterative training process in conventional FL introduces significant computation and communication overhead, which is unfriendly for resource-constrained edge devices. One-shot FL has emerged as a promising approach to mitigate communication overhead, and model-heterogeneous FL solves the problem of diverse computing resources across clients. However, existing methods face challenges in effectively managing model-heterogeneous one-shot FL, often leading to unsatisfactory global model performance or reliance on auxiliary datasets. To address these challenges, we propose a novel FL framework named FedMHO, which leverages deep classification models on resource-sufficient clients and lightweight generative models on resource-constrained devices. On the server side, FedMHO involves a two-stage process that includes data generation and knowledge fusion. Furthermore, we introduce FedMHO-MD and FedMHO-SD to mitigate the knowledge-forgetting problem during the knowledge fusion stage, and an unsupervised data optimization solution to improve the quality of synthetic samples. Comprehensive experiments demonstrate the effectiveness of our methods, as they outperform state-of-the-art baselines in various experimental setups. Our code is available at https://***/YXShi2000/FedMHO. © 2025, CC BY.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Optimization of Node Reduction Using BRKGA for GNN-Based Traffic Speed Forecasting

Optimization of Node Reduction Using BRKGA for GNN-Based Tra...

引用

Congress on Evolutionary Computation

作者： Yuto Inokuchi Pedro Henrique González Israel Mendonça Masayoshi Aritsugi Graduate School of Science and Technology Kumamoto University Kumamoto Japan System Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil Faculty of Advanced Science and Technology Kumamoto University Kumamoto Japan

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

While Spatio-Temporal Graph Convolutional Networks (STGCNs) are an effective method for traffic speed fore-casting, their training and inference tend to be time-consuming. In this paper, we aim to refine these networks by strategically reducing their number of nodes, thereby boosting computational efficiency. The nodes in these graphs represent data observed for road segments, and by analyzing the interconnections and layout of the graph, we can identify nodes with minimal contribution to overall performance. Removing these nodes can potentially decrease computation time while maintaining the prediction accuracy. We employ the Biased Random-Key Genetic Algorithm (BRKGA) to identify a good set of nodes for removal, based on a predefined percentage reduction of the original graph size (e.g., retaining 95 % of the original graph). We evaluate different graph size configurations, ranging from 95 % to 70 % node retention, to determine the least impactful node set performance. Our experiments on three real-world datasets reveal that reducing nodes can decrease computation time by up to 29%, and as a byproduct of removing noise, even improve the prediction accuracy.

关键词： Training Accuracy Graph convolutional networks Roads Noise Layout Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

Efficient Node Reduction Heuristic for GNN-Based Traffic Speed Forecasting

Efficient Node Reduction Heuristic for GNN-Based Traffic Spe...

引用

IEEE/ACM International Symposium on Big Data Computing (BDC)

作者： Yuto Inokuchi Pedro Henrique González Masayoshi Aritsugi Israel Mendonça Graduate School of Science and Technology Kumamoto University Kumamoto Japan System Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil Faculty of Advanced Science and Technology Kumamoto University Kumamoto Japan

ISBN: (数字)9798350367300

ISBN: (纸本)9798350367317

In this paper, we aim to reduce the number of nodes from Graph Neural Networks (GNNs), thereby simplifying models and reducing computational costs. GNNs are highly effective for various tasks, such as prediction, classification, and clustering, due to their ability to learn node and edge attributes and relationships, and they have been utilized for intelligent transportation systems recently by converting sensor networks into graph structures. Deep spatio-temporal neural networks, including Spatio-Temporal Graph Convolutional Networks (STGCNs), capture spatial and temporal dependencies, making them suitable for traffic speed forecasting, traffic demand prediction, and travel time estimation. Despite their success, GNNs face challenges in industrial applications due to significant memory usage and time consumption. In this paper, we propose a new approach to node reduction that outperforms existing methods in computational efficiency. Our experiments on two real-world traffic datasets demonstrate that using the heuristic and edge information to reduce nodes can cut computation time of optimization up to 95% and, by eliminating noise, can even enhance prediction accuracy.

关键词： Graph convolutional networks Noise Memory management Estimation Computational efficiency Forecasting Optimization Intelligent transportation systems Faces Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Multi-Layer Perceptron for Efficient Multivariate Time Series Forecasting

SSRN

引用

SSRN 2023年

作者： Wang, Zhenghong Ruan, Sijie Huang, Tianqiang Zhou, Haoyi Zhang, Shanghang Wang, Yi Wang, Leye Huang, Zhou Liu, Yu Institute of Remote Sensing and Geographic Information System School of Earth and Space Sciences Peking University Beijing China School of Computer Science and Technology Beijing Institute of Technology Beijing China College of Computer and Cyber Security Fujian Normal University Fujian China School of Computer Science and Engineering Beihang University Beijing China School of Computer Science Peking University Beijing China

Efficient and effective multivariate time series (MTS) forecasting is critical for real-world applications, such as traffic management and energy dispatching. Most of the current deep learning studies (e.g., Spatio-Temporal Graph Neural Networks and Transformers) fall short in a trade-off between performance and efficiency. Existing MTS forecasting studies have yet to fully and simultaneously address issues such as modelling both temporal and variate dependencies, as well as the temporal locality, hindering broader applications. In this paper, we propose a lightweight model, i.e., Time Series MLP (TSP). TSP is built upon MLP and relies on the PrecMLP with the proposed computationally free Precurrent mechanism to model both the variate dependency and temporal locality, thus being simple, effective and versatile. Extensive experiments show that TSP outperforms state-of-the-art methods on 16 datasets for both Long-term Time-series Forecasting and Traffic Forecasting tasks. Furthermore, it attains a significant reduction of at least 95.97% in practical training speed on the CPU. © 2023, The Authors. All rights reserved.

关键词： Multilayer neural networks

来源：评论

学校读者我要写书评

暂无评论

Quality-Oriented Task Assignment for Heterogeneous Users in Mobile Crowdsensing

Quality-Oriented Task Assignment for Heterogeneous Users in ...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Kang Chen Peng Li Weiyi Huang Lei Nie Haizhou Bao Qin Liu School of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System China School of Cyber Science and Engineering Wuhan University China

Mobile crowdsensing (MCS) is a potential technology for large-scale data collection. This technology requires the platform to recruit users to complete tasks in specific areas. A vital issue in MCS is task assignment, and most existing task assignment efforts consider only a single user type, which is not reasonable in real scenarios. Task assignment becomes more complicated when the platform tries to assign tasks to heterogeneous users with a limited budget in the platform. In this paper, we consider a quality-oriented task assignment for heterogeneous users problem. Professional users have a high sensing quality with a high cost, and normal users have a low sensing quality with a low cost First, we model the sensing capabilities and the costs of different users and formulate the quality-oriented task assignment for heterogeneous users problem. Then, we design the integer linear programming form and prove that the problem is NP-hard. By verifying the submodularity of the objective function, we present a greedy algorithm. Considering the inefficiency of the algorithm, we design two genetic algorithms to improve the total sensing quality. Finally, we evaluate the proposed algorithms under different cost cases based on a real dataset The results show that our proposed algorithm performs well under different cost distribution scenarios.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：