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

New Offloading Method of computing Task Based on Gray Wolf Hunting Optimization Mechanism for the IOV

IEEE Transactions on Network and Service Management 2025年

作者： Zhang, Jie Zhang, De-Gan Qiao, Meng Hong-Lin, E. Zhang, Ting Zhang, Ping University of Macau Key Lab of Internet of Things for Smart City Faculty of Science and Technology 999078 China Tianjin University of Technology Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin300384 China Tianjin University of Sport School of Sports Economics and Management Tianjin301617 China

Task offloading, as an effective solution, provides low latency and sufficient computing resources for mobile users in the network. However, how to reasonably offload to reduce system overhead is a challenging issue today. This article takes user terminals, edge servers, and idle vehicles with resources as the network structure, and is inspired by the highly social nature of the gray wolf pack. It proposes a new offloading method of edge computing task based on hunting optimizing mechanism of gray wolf for the Internet of Vehicle (IOV). Firstly, an adaptive weight factor is proposed to balance the weight ratio of delay and energy consumption in the system cost under the constraints of delay and energy consumption. With delay and computing resources of vehicles and servers as constraints, a multi constraint minimization system cost problem is proposed. Secondly, the hunting process of the gray Wolf optimization algorithm is used to find the optimal solution of the unloading scheme, The Levy flight strategy was added to enhance the global search ability of the algorithm, and a dynamic weight strategy was introduced to improve the convergence performance of the algorithm. Finally, the improved gray Wolf optimization algorithm was used to solve the optimal unloading plan and minimum *** simulation results show that compared with traditional gray Wolf optimization algorithm offloading schemes, the proposed scheme in this paper requires lower system costs. © 2004-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

DCAS-BMT: Dynamic Construction and Adjustment of Skewed Bonsai Merkle Tree for Performance Enhancement in Secure Non-Volatile Memory

引用

IEEE Transactions on Computers 2025年

作者： Zhang, Yu Chen, Renhai Yan, Hangyu Wu, Hongyue Feng, Zhiyong Tianjin University College of Intelligence and Computing Tianjin300350 China Nanjing University State Key Lab. for Novel Software Technology Nanjing210023 China Yunnan University of Finance and Economics Yunnan Key Lab. of Service Computing Kunming650221 China

Traditional DRAM-based memory solutions face challenges, including high energy consumption and limited scalability. Non-Volatile Memory (NVM) offers low energy consumption and high scalability. However, security challenges, particularly data remanence vulnerabilities, persist. Prevalent methods such as the Bonsai Merkle Tree (BMT) are employed to ensure data security. However, the consistency requirements for integrity tree updates have led to performance issues. It is observed that compared to a secure NVM system without persistent secure metadata, the average overhead for updating and persisting the BMT root with persistent secure metadata is as high as 2.48 times. Therefore, this paper aims to mitigate these inefficiencies by leveraging the principle of memory access locality. We propose the Dynamic Construction and Adjustment of Skewed Bonsai Merkle Tree (DCAS-BMT). The DCAS-BMT is dynamically built and continuously adjusted at runtime according to access weights, ensuring frequently accessed memory blocks reside on shorter paths to the root node. This reduces the verification steps for frequently accessed memory blocks, thereby lowering the overall cost of memory authentication and updates. Experimental results using the USIMM memory simulator demonstrate that compared to the widely used BMT approach, the DCAS-BMT scheme shows a performance improvement of 34.1%. © 1968-2012 IEEE.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

CESFusion: Cross-Frequency Enhanced Spatial-Spectral Fusion Network for Hyperspectral and Multispectral Image Fusion

引用

IEEE Transactions on Geoscience and Remote Sensing 2025年 63卷

作者： Zhang, Haozheng Yang, Yanhong Li, Chaoyang Lu, Yanjie Zhang, Guodao Chen, Shengyong School of Computer Science and Engineering Tianjin University of Technology Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin300384 China Engineering Research Center of Learning- Based Intelligent System Ministry of Education Key Laboratory of Computer Vision and Systems School of Computer Science and Engineering Tianjin University of Technology Tianjin300384 China Institute of Intelligent Media Computing Hangzhou Dianzi University Hangzhou310018 China

The fusion of hyperspectral and multispectral images involves integrating high spectral resolution hyperspectral image (HSI) and high spatial resolution multispectral image (MSI) to generate a HSI with high spatial and spectral resolution (HR-HSI). Existing HSI-MSI fusion methods primarily focus on information fusion within the spatial domain;however, few solutions have explored the employment of frequency analysis to enhance spatial resolution, limiting their capability for global perception. In this paper, we propose an efficient and novel paradigm for HSI-MSI fusion through the cross-frequency enhanced spatial-spectral fusion network, named CESFusion, exploring the complementary fusion of information between the spatial and frequency domains. Specifically, we first present the cross-frequency domain fusion module (CFFM) to perform global analysis through the Fourier transform and effectively integrate and enhance the frequency domain information from both HSI and MSI. Subsequently, we propose the spectral modeling module (SpeMM) based on state space model (SMM) to capture long-range spectral dependencies with linear complexity, and integrate it with the spatial residual block-based module (SRM) for joint spatial-spectral feature extraction. Finally, to enable sufficient interaction between the spatial and frequency domains, we adopt the cross-domain interaction module (CDIM), capturing and integrating complementary information from both domains. Moreover, a frequency-based loss function is purposely designed to further improve the restoration of global information. Extensive experiments conducted on both synthetic and real datasets demonstrate the superiority of our CESFusion, as evidenced by both quantitative and qualitative evaluation results. © 2025 IEEE.

关键词： Image fusion

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-aware Superpoint Graph Transformer for Weakly Supervised 3D Semantic Segmentation

引用

IEEE Transactions on Fuzzy Systems 2025年

作者： Fan, Yan Wang, Yu Zhu, Pengfei Hui, Le Xie, Jin Hu, Qinghua Tianjin University College of Intelligence and Computing Tianjin300350 China Ministry of Education of the People's Republic of China Engineering Research Center of City Intelligence and Digital Governance China Haihe Laboratory of Itai Tianjin China Northwestern Polytechnical University School of Electronics and Information Shaanxi Key Laboratory of Information Acquisition and Processing China Nanjing University of Science and Technology Pca Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China

Weakly supervised 3D semantic segmentation has successfully mitigated the labor-intensive and time-consuming task of annotating 3D point clouds. However, reliably utilizing the minimal point-wise annotations for unlabeled data in complex and large-scale scenes is still challenging, such as only 20 points labeled in 2 million points. To tackle this challenge, we propose a new Uncertainty-aware Superpoint Graph Transformer (UaSGT) framework that utilizes minimal annotations for unlabeled data learning through reliable long-range supervision propagation from labeled superpoints to unlabeled superpoints. First, we propose a superpoint graph transformer to achieve long-range supervision propagation along the attention-based fuzzy subsets defined on superpoints. The attention-based fuzzy subset measures the membership of unlabeled superpoints to clusters centered on labeled superpoints. Second, we employ an uncertainty-aware membership rectification technique on the fuzzy subset to ensure reliable propagation among superpoints within the same category. This technique integrates an uncertainty prediction module to mask the influence of unreliable membership and a spatial prior refinement module to reduce uncertainty in intra-class membership degrees. Finally, experimental results on two large-scale benchmarks S3DIS and ScanNet-V2 demonstrate the superiority of our approach compared to the state-of-the-art with at least 90% annotation reduction, and our method also achieves comparable performance to fully supervised methods with less than 0.1% labeled points. Our code is available at https://***/fanyan0411/UaSGT. © 2025 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

A new algorithm of service discovery based on DHT for mobile application

引用

Journal of Networks 2011年第10期6卷 1466-1474页

作者： Zhang, De-gan Hu, Yu-xia Wang, Dong Liang, Yan-pin Tianjin Key Lab of Intelligent Computing and Novel software Technology Tianjin University of Technology China Ministry of Education China

In order to solve how to enhance the discovery efficiency and coverage, based on DHT (Distributed Hash Table) and Small World Theory, we put forward a new algorithm of service discovery for mobile application. In traditional DHT discovery algorithm, each node maintains the finger-table that store node information of adjacent node. By using Small-World Theory, we put forward adding a remote node into the finger-table and adding the corresponding remote index. It is different from selecting the remote connection node randomly. We select the remote connection node by calculating local node and it can assure not only the cove range of service discovery but also not increase the length of finger-table, which simplifies the calculation of the finger-table and maintenance work. The simulation proved that the algorithm can reduce the path length of service discovery effectively, improve success rate of service discovery. © 2011 Academy Publisher.

关键词： Mobile computing

来源：评论

学校读者我要写书评

暂无评论

A kind of new web-based method of seamless migration

引用

International Journal of Advancements in computing technology 2011年第5期3卷 32-40页

作者： Zhang, De-gan Dai, Wen-bo Kang, Xue-jing Wang, Dong Tianjin Key Lab of Intelligent Computing and Novel software Technology Tianjin University of Technology China Ministry of Education China

To improve the mobile applications under the banner of the Internet of Things, we propose and design a new kind of Web-based method of seamless migration. The method can ensure the media seamless migration fast, smoothly and correctly. Implemented method will better solve the migration of media on the application layer of mobile application. Tests have shown our suggested seamless migration strategies are effective. This method will serve universal Web-based mobile application.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Detecting and Tracking Moving Targets on Omnidirectional Vision

引用

Transactions of tianjin University 2009年第1期15卷 13-18页

作者：杨淑莹葛为民张成何丕廉 School of Computer Science and Technology Tianjin University Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin University of Technology

A method was presented to implement the detecting and tracking of moving targets through omnidirec-tional vision. The method combined optical flow with particle filter arithmetic, in which optical flow field was used to detect and locate moving targets and particle filter was used to track the detected moving objects. According to the circular image character of omnidirectional vision, the calculation equation of optical flow field and the tracking arithmetic of particle filter were improved based on the polar coordinates at the omnidirectional center. The edge of a randomly moving object could be detected by optical flow field and was surrounded by a reference region in the particle filter. A dynamic motion model was established to predict particle state. Histograms were used as the fea-tures in the reference region and candidate regions. The mutual information (MI) and Gaussian function were com-bined to calculate particle weights. Finally, the state of tracked object was computed by the total particle states with weights. Experiment results show that the proposed method could detect and track moving objects with better real-time performance and accuracy.

关键词： omnidirectional vision optical flow particle filter mutual information

来源：评论

学校读者我要写书评

暂无评论

A kind of new web-based method of media seamless migration for mobile service

引用

Journal of Information and Computational Science 2011年第10期8卷 1825-1836页

作者： Zhang, Degan Dai, Wenbo Liang, Yanpin Liu, Zhaojing Tianjin Key Lab. of Intelligent Computing and Novel software Technology Tianjin University of Technology Tianjin 300191 China Ministry of Education Tianjin 300191 China

In order to improve the mobile services under the banner of the Internet of Things, we propose and design a new kind of Web-based method of media seamless migration. The method can ensure the media seamless migration fast, smoothly and correctly. Implemented method will better solve the migration of media on the application layer of mobile service. Our tests have shown our suggested seamless migration strategies are effective. This method will serve universal Web-based E-Learning, E-office, E-business and so on. © 2011 by Binary Information Press.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Time-Ordered Collaborative Filtering for News Recommendation

引用

China Communications 2015年第12期12卷 53-62页

作者： XIAO Yingyuan AI Pengqiang Ching-Hsien Hsu WANG Hongya JIAO Xu Tianjin University of Technology Tianjin Key Lab of Intelligence Computing and Novel Software Technology Chung Hua University Donghua University

Faced with hundreds of thousands of news articles in the news websites,it is difficult for users to find the news articles they are interested ***,various news recommender systems were *** the news recommendation,these news articles read by a user is typically in the form of a time ***,traditional news recommendation algorithms rarely consider the time sequence characteristic of user browsing ***,the performance of traditional news recommendation algorithms is not good enough in predicting the next news article which a user will *** solve this problem,this paper proposes a time-ordered collaborative filtering recommendation algorithm(TOCF),which takes the time sequence characteristic of user behaviors into ***,a new method to compute the similarity among different users,named time-dependent similarity,is *** demonstrate the efficiency of our solution,extensive experiments are conducted along with detailed performance analysis.

来源：评论

学校读者我要写书评

暂无评论

Research on service matching method for LBS

引用

International Journal of Advancements in computing technology 2011年第6期3卷 131-138页

作者： Zhang, De-gan Wang, Dong Liang, Yan-bin Liu, Zhao-jing Tianjin Key Lab of Intelligent Computing and Novel software Technology Tianjin University of Technology China Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education China

With the development of mobile computing, location-based service (LBS) is becoming an important aspect of applied research, the technology of service discovery becomes a core issue. So service matching is the most important in service discovery, also it became hot spot in researching. In the process of providing service to user, not only the quality of service should be improved, but also user's preferences should be considered. The existing mainstream service discovery protocols in the location-oriented service were compared in this paper. Based on analysis and comparison, a new algorithm of service matching is proposed in this paper. It improves the service matching success rate through hierarchical matching and full accounting of the user's preference, and ultimately aim to improve service quality.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：