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

2022 International Conference on Electronic Information Engineering, Big Data, and computer technology, EIBDCT 2022

作者： Yu, Jing Lang, Yue Li, Xuewen Zhang, Jin Zheng, Shaojie Gong, Jibing School of Information Science and Engineering Yanshan University Qinhuangdao066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao066004 China Key Laboratory for Software Engineering of Hebei Province Yanshan University Qinhuangdao066004 China

ISBN: (纸本)9781510655133

Explainable recommendation systems, which can produce high-accuracy recommendations and help users make quick decisions, have become a hotspot in research field. Most of existing research algorithms committed to improving the accuracy of recommendation, but ignored the interpretability of recommendation. We propose a semantic recommendation algorithm through Reinforcement Learning and weighted meta-paths which analyzes and selects the meta-path, and uses Reinforcement Learning network to train the weight of meta-path. This method can effectively solve data sparsity, improve the accuracy of recommendation, and increase interpretability. Compared with the baseline method, indicators of the recommended methods for integrating Reinforcement Learning with Heterogeneous Information Networks have been greatly improved, as verified and compared on a real MovieLens 1M dataset. Experimental results prove that the algorithm can effectively improve the accuracy and interpretability of the recommendation. © 2022 SPIE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Complementarity Analysis of Cloud API Ecosystems: An Empirical Study on ProgrammableWeb and Huawei AppGallery Datasets

Complementarity Analysis of Cloud API Ecosystems: An Empiric...

引用

IEEE International Conference on Web Services (ICWS)

作者： Xiaowei Liu Mengmeng Sun Wenhui Chen Dianlong You Limin Shen Zhen Chen School of Information Science and Engineering Yanshan University Qinhuangdao China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao China

ISBN: (数字)9798350368550

ISBN: (纸本)9798350368567

With the proliferation of the digital economy, cloud API has become the best carrier for data transmission and capability replication in software development. In the service-oriented software development paradigm, developers select appropriate cloud APIs for mashup creation based on their practical needs, where complementarity is an important consideration. Complementarity is reflected in various implicit relationships within mashups and cloud APIs, making complementarity analysis of cloud API ecosystems a critical issue. However, existing studies have overlooked the complementarity, and the lack of application variety in the primary dataset ProgrammableWeb has added a threat to the validity and generalization. In this paper, we first build a dataset of two cloud API ecosystems: ProgrammableWeb centering on mashup creation and Huawei AppGallery centering on mobile app development. Then, we conduct statistical and graph analysis to compare the two ecosystems. Finally, we propose a modeling approach to quantify complementarity and perform an analysis to investigate the role of complementarity in cloud API ecosystems. The results reveal differences between mashups and mobile apps in their preferences for cloud APIs. It also highlights the potential of complementarity in addressing the long-tail problem in cloud API ecosystems and improving cloud API recommendations.

关键词： Analytical models Mashups Ecosystems Mobile applications Data communication Software development management

来源：评论

学校读者我要写书评

暂无评论

A Robot Pick and Place Skill Learning Method Based on Maximum Entropy and DDQN Algorithm

A Robot Pick and Place Skill Learning Method Based on Maximu...

引用

2021 International Conference on Robotics Automation and Intelligent Control, ICRAIC 2021

作者： Wu, Peiliang Zhang, Yan Li, Yao Mao, Bingyi Chen, Wenbai Gao, Guowei School of Information Science and Engineering Yanshan University Hebei Qinhuangdao066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Hebei Qinhuangdao066004 China School of Automation Beijing Information Science and Technology University Beijing100192 China

Pick and place (PAP) skill learning is a fundamental ability of intelligent robots, such as home service robot. Due to the NP-hard nature of the PAP problem, it takes a long time for an intelligent robot to learn the PAP skill based on current methods. In order to improve the learning efficiency of robot PAP skills, this paper proposes a Soft-DDQN-based PAP skill learning method. Firstly, the Soft-DDQN is proposed by introducing maximum entropy into robot DDQN framework, and the learning goal of Soft-DDQN is to maximize reward and information entropy. Secondly, PAP problem is modelled as a discrete form and Soft-DDQN is applied to solve the PAP problem. Finally, in order to verify the efficiency of Soft-DDQN-based PAP skill learning, comparisons have been given from two standard perspectives and shown that Soft-DDQN improves efficiency of PAP skill learning evidently. © 2022 Institute of Physics Publishing. All rights reserved.

关键词： Intelligent robots

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient computation offloading via deep reinforcement learning in mobility-aware multi-access edge computing systems with diverse users

引用

Expert systems with Applications 2025年 286卷

作者： Wu, Haixing Jin, Shunfu School of Information Science and Engineering Yanshan University Qinhuangdao066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao066004 China

Multi-access Edge Computing (MEC) has been a promising solution that enables Internet of Things (IoT) devices to support computation-intensive applications by offloading some tasks to the network edge. However, most existing offloading methods in MEC systems are based on the premise of scenarios with either single-type or stable users, which is not aligned with the practical situations of users’ diversity and mobility. In addition, these methods always ignore energy saving strategies in MEC systems, which inevitably degrades Utility Energy Efficiency (UEE). To tackle these issues, considering personalized requirements from diverse users and idle energy consumption in MEC servers, we propose a novel computation offloading architecture with adaptive sleeping mechanism and heterogeneous MEC servers. Based on the architecture, we investigate energy-efficient computation offloading in mobility-aware MEC systems with diverse users. Under the Deep Reinforcement Learning (DRL) framework, we propose a Twin Delayed Deep Deterministic Policy Gradient Algorithm with Bursty Traffic (TD3-BT), in which the inherent correlation of task arrivals is taken into account to capture the behavior of correlated traffic and provide rational metrics estimation within one time slot. A long-term system cost minimization problem is formulated to optimize computation offloading for the trade-off between system delay and UEE. Assisted by TD3-BT, the formulated problem is effectively solved and the decision making in each time slot is provided for diverse users. Experimental results demonstrate that our TD3-BT algorithm achieves superior performance under various offloading scenarios compared to some benchmarks. © 2025 Elsevier Ltd

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

VT-SGN:Spiking Graph Neural Network for Neuromorphic Visual-Tactile Fusion

引用

IEEE Transactions on Haptics 2024年 PP卷 PP-PP页

作者： Wu, Peiliang Zhang, Haozhe Li, Yao Chen, Wenbai Gao, Guowei Yanshan University School of Information Science and Engineering Qinhuangdao066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao066004 China Beijing Information Science and Technology University School of Automation Beijing100192 China

Current issues with neuromorphic visual-tactile perception include limited training network representation and inadequate cross-modal fusion. To address these two issues, we proposed a dual network called visual-tactile spiking graph neural network (VT-SGN) that combines graph neural networks and spiking neural networks to jointly utilize the neuromorphic visual and tactile source data. First, the neuromorphic visual-tactile data were expanded spatiotemporally to create a taxel-based tactile graph in the spatial domain, enabling the complete exploitation of the irregular spatial structure properties of tactile information. Subsequently, a method for converting images into graph structures was proposed, allowing the vision to be trained alongside graph neural networks and extracting graph-level features from the vision for fusion with tactile data. Finally, the data were expanded into the time domain using a spiking neural network to train the model and propagate it backwards. This framework effectively utilizes the structural differences between sample instances in the spatial dimension to improve the representational power of spiking neurons, while preserving the biodynamic mechanism of the spiking neural network. Additionally, it effectively solves the morphological variance between the two perceptions and further uses complementary data between visual and tactile. To demonstrate that our approach can improve the learning of neuromorphic perceptual information, we conducted comprehensive comparative experiments on three datasets to validate the benefits of the proposed VT-SGN framework by comparing it with state-of-the-art studies. © 2008-2011 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Automatic web page data extraction through MD5 trigeminal tree and improved BIRCH

Automatic web page data extraction through MD5 trigeminal tr...

引用

2022 International Conference on Electronic Information Engineering, Big Data, and computer technology, EIBDCT 2022

作者： Gong, Jibing Kou, Xiaomeng Zhang, Hanyun Peng, Jiquan Gong, Shishan Wang, Shuli School of Information Science and Engineering Yanshan University Qinhuangdao066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao066004 China Key Laboratory for Software Engineering of Hebei Province Yanshan University Qinhuangdao066004 China School of Information Science Yanshan University Qinhuangdao066004 China

ISBN: (纸本)9781510655133

This paper proposes an automatic data extraction algorithm for web pages based on noise reduction and visualization blocks' construction. In this algorithm, we first build an MD5 trigeminal tree of the web page's source files using a Message-Digest Algorithm. And then we arrange some noise reduction. Finally, we construct visualization blocks by an optimized cluster algorithm named BIRCH A-CF which could create an area clustering feature forest and complete the clustering by dynamically changing the circle's radius according to the correction factor. We perform experiments on eight different datasets to compare our method with eight baseline methods. The experimental results show that our approach outperforms current methods by providing more accuracy and robustness, it also accelerates noise reduction and reduces the number of nodes effectively. © 2022 SPIE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

A homogenization method for nonlinear inhomogeneous elastic materials

引用

virtual Reality & Intelligent Hardware 2021年第2期3卷 156-170页

作者： Jing ZHAO Fei ZHU Liyou XU Yong TANG Sheng LI College of Information Science and Engineering Yanshan UniversityQinhuangdaoHebei 066004China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province QinhuangdaoHebei 066004China School of Electronics Engineering and Computer Science Peking UniversityBeijing 100871China Beijing Engineering Research Center for Virtual Simulation and Visualization Beijing 100871China

Background Fast simulation techniques are strongly favored in computer graphics,especially for the nonlinear inhomogeneous elastic *** homogenization theory is a perfect match to simulate inhomogeneous deformable objects with its coarse discretization,as it reveals how to extract information at a fine scale and to perform efficient computation with much less *** existing homogenization method is not applicable for ubiquitous nonlinear materials with the limited input deformation *** In this paper,we have proposed a homogenization method for the efficient simulation of nonlinear inhomogeneous elastic *** approach allows for a faithful approximation of fine,heterogeneous nonlinear materials with very coarse *** analysis provides the basis of a linear deformation space and modal derivatives extend the space to a nonlinear regime;based on this,we exploited modal derivatives as the input characteristic deformations for *** also present a simple elastic material model that is nonlinear and anisotropic to represent the homogenized *** nonlinearity of material deformations can be represented properly with this *** material properties for the coarsened model were solved via a constrained optimization that minimizes the weighted sum of the strain energy deviations for all input deformation *** arbitrary number of bases can be used as inputs for homogenization,and greater weights are placed on the more important low-frequency *** Based on the experimental results,this study illustrates that the homogenized material properties obtained from our method approximate the original nonlinear material behavior much better than the existing homogenization method with linear displacements,and saves orders of magnitude of computational *** The proposed homogenization method for nonlinear inhomogeneous elastic materials is capable of capturing the nonlinear dynamics of the

关键词： Physical-based simulation Homogenization theory Heterogeneous material Modal basis

来源：评论

学校读者我要写书评

暂无评论

A virtualized data center energy-saving mechanism based on switching operating mode of physical servers and reserving virtual machines

A virtualized data center energy-saving mechanism based on s...

引用

作者： Yin, Chunxia Liu, Jian Jin, Shunfu College of Information Science and Engineering Yanshan University Qinhuangdao China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao China Ocean College of Hebei Agricultural University Qinhuangdao China Institute of Computing Technology Chinese Academy of Sciences Beijing China

The energy consumption of virtualized data centers has grown very fast in last several years. Because a large number of hosts are running in an idle state, virtualized data centers waste a large amount of electric energy. To save more energy for virtualized data centers, an energy-saving mechanism is proposed based on switching operating mode of physical servers and reserving virtual machines (VMs). The main idea is that when the amount of idle VMs reaches twice of a specified threshold, half of these idle VMs are reserved to process the new task that is about to arrive, and the physical server which hosts the other half of the idle VMs is switched to the sleep mode. From the perspective of task arrival rate and sleep parameters, we use two-dimensional Markov processes to analyze the proposed energy-saving mechanisms. By using matrix geometry solutions, we theoretically estimate energy consumption and response performance. According to the numerical experiments, the proposed energy-saving mechanism obviously cut down electric energy consumption and ensures response performance. Finally, the specified threshold for the amount of VMs is optimized by building a cost function. © 2020 John Wiley & Sons, Ltd.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

A Practical Cloud API Complementary Recommendation Service for Mashup Creation

A Practical Cloud API Complementary Recommendation Service f...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Xiaowei Liu Wenhui Chen Mengmeng Sun Yali Si Zhen Chen School of Information Science and Engineering Yanshan University Qinhuangdao China School of Computer Science and Engineering Changshu Institute of Technology Changshu China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

With the popularity of the service-oriented development paradigm in the cloud era, numerous cloud APIs have been developed. The continuous proliferation of cloud APIs has submerged developers in a sea of options, bringing the need for cloud API recommendation techniques. Most existing cloud API recommendation methods focus on theoretical studies and neglect practical applications. As a result, these methods face several challenges, such as covering recommendation scenarios, generating real-time responses, and handling concurrent requests. In this paper, we propose and implement a practical cloud API complementary recommendation service for mashup creation. To address the above challenges, we first propose a cloud API complementary recommendation framework named FICR, which exploits feature interactions to mine implicit complementarity and models complementarity from the mashup side and the target cloud API side for scenario coverage. Then, we conduct performance optimization via precoding and batch size tuning to optimize FICR for real-time responses. Finally, we design a minimum-connection load balancing algorithm with resource early warning and build a distributed system for concurrent requests. Experiments conducted on real-world datasets show that FICR outperforms state-of-the-art baseline models in complementary recommendation scenarios, and demonstrate that the implemented service meets the real-time and concurrency requirements. The service will serve as a practical tool to help developers during mashup creation.

关键词： Concurrent computing Federated learning Mashups Precoding Load management Real-time systems Tuning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：