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

A sketch recognition method based on bi-modal model using cooperative learning paradigm

Neural Computing and Applications 2024年第23期36卷 14275-14290页

作者： Zhang, Shihui Wang, Lei Cui, Zhiguo Wang, Shi School of Information Science and Engineering Yanshan University Hebei Street West Section Hebei Province Qinhuangdao066000 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Hebei Street West Section Hebei Province Qinhuangdao066000 China School of Information Technology Hebei University of Business and Economics Xuefu Road Hebei Province Shijiazhuang050061 China School of Mathematics and Information Science and Technology Hebei Normal University of Science and Technology Hebei Street West Section Hebei Province Qinhuangdao066000 China

Static image is an important form of displaying a sketch, representing the appearance information of the sketch. And a stroke sequence composed of several points can also express the shape and contour information of the sketch. Therefore, it is very reasonable to treat a sketch as point-modal data and image-modal data simultaneously. In this paper, a method based on bi-modal model using cooperative learning paradigm is proposed for the sketch recognition task. Specifically, in the point-modal branch, a structural point convolution block is developed by properly dividing local regions to preserve the structural information. In the image-modal branch, the hierarchical residual structure is used to fully extract image-modal features. To reduce the negative impact of noisy samples on the recognition performance, a cooperative learning paradigm is designed based on different perceptual abilities of two modal branches on noisy samples, that is, when training the two branches, the noisy samples can be filtered out through information exchanges and mutual learning. Extensive experiments on the sketch datasets TU-Berlin and QuickDraw show that the proposed method outperforms most baseline methods and has many advantages such as no dependence on additional data and stroke information. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Position Measurement Based Slave Torque Feedback Control for Teleoperation systems With Time-Varying Communication Delays

引用

IEEE/CAA Journal of Automatica Sinica 2023年第2期10卷 388-402页

作者： Xian Yang Jing Yan Changchun Hua Xinping Guan the Institute of Information Science and Engineering Yanshan University the Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004China IEEE the Institute of Electrical Engineering Yanshan UniversityQinhuangdao 066004China the Department of Automation Shanghai Jiao Tong UniversityShanghai 200240China

Bilateral teleoperation system is referred to as a promising technology to extend human actions and intelligence to manipulating objects *** the tracking control of teleoperation systems,velocity measurements are necessary to provide feedback ***,due to hardware technology and cost constraints,the velocity measurements are not always *** addition,the time-varying communication delay makes it challenging to achieve tracking *** paper provides a solution to the issue of real-time tracking for teleoperation systems,subjected to unavailab.e velocity signals and time-varying communication *** order to estimate the velocity information,immersion and invariance(I&I)technique is employed to develop an exponential stability velocity *** the proposed velocity observer,a linear relationship between position and observation state is constructed,through which the need of solving partial differential and certain integral equations can be ***,the mean value theorem is exploited to separate the observation error terms,and hence,all functions in our observer can be analytically *** the estimated velocity information,a slave-torque feedback control law is presented.A novel Lyapunov-Krasovskii functional is constructed to establish asymptotic tracking *** particular,the relationship between the controller design parameters and the allowable maximum delay values is ***,simulation and experimental results reveal that the proposed velocity observer and controller can guarantee that the observation errors and tracking error converge to zero.

关键词： Asymptotic stability bilateral teleoperation time-varying delay velocity observer

来源：评论

学校读者我要写书评

暂无评论

A cloud-edge-device collab.rative offloading scheme with heterogeneous tasks and its performance evaluation

引用

Frontiers of Information technology & Electronic Engineering 2024年第5期25卷 664-684页

作者： Xiaojun BAI Yang ZHANG Haixing WU Yuting WANG Shunfu JIN School of Information Science and Engineering Yanshan UniversityQinhuangdao 066004China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan UniversityQinhuangdao 066004China

How to collab.ratively offload tasks between user devices,edge networks(ENs),and cloud data centers is an interesting and challenging research *** this paper,we investigate the offoading decision,analytical modeling,and system parameter optimization problem in a collab.rative cloud-edge device environment,aiming to trade off different performance *** to the differentiated delay requirements of tasks,we classify the tasks into delay-sensitive and delay-tolerant *** meet the delay requirements of delay-sensitive tasks and process as many delay-tolerant tasks as possible,we propose a cloud-edge device collab.rative task offoading scheme,in which delay-sensitive and delay-tolerant tasks follow the access threshold policy and the loss policy,*** establish a four-dimensional continuous-time Markov chain as the system *** using the Gauss-Seidel method,we derive the stationary probability distribution of the system ***,we present the blocking rate of delay-sensitive tasks and the average delay of these two types of *** experiments are conducted and analyzed to evaluate the system performance,and numerical simulations are presented to evaluate and validate the effectiveness of the proposed task offloading ***,we optimize the access threshold in the EN buffer to obtain the minimum system cost with different proportions of delay-sensitive tasks.

关键词： Edge computing Ofloading scheme Cloud-edge device collab.ration Markov chain Cost function

来源：评论

学校读者我要写书评

暂无评论

Pricing Policy for a Dynamic Spectrum Allocation Scheme with Batch Requests and Impatient Packets in Cognitive Radio Networks

引用

Journal of systems Science and systems Engineering 2022年第2期31卷 133-149页

作者： Haixing Wu Shunfu Jin Wuyi Yue School of Information Science and Engineering Yanshan UniversityQinhuangdao 066004China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan UniversityQinhuangdao 066004China Department of Intelligence and Informatics Konan UniversityKobe 658-8501Japan

In cognitive radio networks(CRNs),multiple secondary users may send out requests simultaneously and one secondary user may send out multiple requests at one time,i.e.,request arrivals usually show an aggregate ***,a secondary user packet waiting in the buffer may leave the system due to impatience before it is transmitted,and this impatient behavior inevitably has an impact on the system *** to investigate the influence of the aggregate behavior of requests and the likelihood of impatience on a dynamic spectrum allocation scheme in CRNs,in this paper a batch arrival queueing model with possible reneging and potential transmission interruption is *** constructing a Markov chain and presenting a transition rate matrix,the steady-state distribution of the queueing model along with a dynamic spectrum allocation scheme is derived to analyze the stochastic behavior of the ***,some important performance measures such as the loss rate,the balk rate and the average delay of secondary user packets are ***,system experiments are carried out to show the change trends of the performance measures with respect to batch arrival rates of secondary user packets for different impatience parameters,different batch sizes of secondary user packets,and different arrival rates of primary user ***,a pricing policy for secondary users is presented and the dynamic spectrum allocation scheme is socially optimized.

关键词： Cognitive radio networks dynamic spectrum scheme batch arrival impatient packets Markov chain social optimization

来源：评论

学校读者我要写书评

暂无评论

Learning to Cluster Person in the Video via Graph Convolution Network 13

Learning to Cluster Person in the Video via Graph Convolutio...

引用

13th International Conference on Information technology in Medicine and Education, ITME 2023

作者： Li, Wei Liang, Sixin Bian, Ang Du, Guodong College of Computer Science Sichuan University Chengdu China School of Information Science and Engineering Yanshan University The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

ISBN: (纸本)9798350319156

Video person re-identification is receiving academic interest. However, the practical application of the algorithm is hardly supported because of prohibitive annotated data. Hence, the study for unlab.led data will lead to an attractive alternative. This work explores an innovative strategy, namely, learning to cluster unlab.led person in the video through graph convolutional networks. In this paper, we find that the possibility of inter-frame linkage can be inferred from context. Therefore, a pose-guided topology linkage clustering framework is proposed. Our framework consists of three modules: (i) a pose-guided representation module;(ii) a pose-guided embedding module;(iii) a link prediction module. Firstly, the representation coding alone is performed at the level of relational induction bias, embedding the implicit pose structure information in image features. Then, based on the consideration of the topology relationship between adjacent and cross-frame, graph convolutional network is introduced to infer the likelihood of linkage between frame nodes. Experiments show that the method demonstrates excellent scalab.lity in addition to being an effective response to person clustering in case of changes, and does not need the number of clusters as a prior. © 2023 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

BAT: Mining Binary-API Topic for Multi-service Application Development 26

BAT: Mining Binary-API Topic for Multi-service Application D...

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： He, Pengfei Liu, Linlin You, Dianlong Shen, Limin Chen, Zhen Yanshan University School of Information Science and Engineering Qinhuangdao China Chinese Academy of Sciences National Science Libraries Beijing China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

ISBN: (纸本)9798350331684

With the growing popularity of API-driven multiservice application (mashup) development, the burgeoning web APIs have left developers drowning in the sea of web API selections. Matching developers with the most appropriate APIs is the key to improving user satisfaction and promoting more popular web applications. As a result, more and more researchers pay attention to web API recommender systems based on collab.rative filtering. However, employing collab.rative filtering to recommend APIs is challenging due to the severe sparsity of mashup and API interactions. To address this problem, we propose a probabilistic generative model, called the Binary-API Topic model (BAT), to parameterize mashups and APIs. Technically, BAT is equipped with a mechanism to extract binary-APIs and predict unknown pairwise interactions. To improve generality and capture more relevance from a limited number of interactions, we learn binary-API topics by directly modeling the generation of API co-occurrence patterns across the repository (all mashup collections from ***). The main advantage of BAT is that it preserves API co-occurrence patterns in model learning and exploits the rich global relevance. Finally, through extensive experiments, we demonstrate that BAT can achieve the highest performance on the sparse real-world data set. © 2023 IEEE.

关键词： Collab.rative filtering

来源：评论

学校读者我要写书评

暂无评论

Association Rule Guided Web API Complementary Function Recommendation for Mashup Creation: An Explainable Perspective 17th

Association Rule Guided Web API Complementary Function Recom...

引用

17th CCF Conference on computer Supported Cooperative Work and Social Computing, ChineseCSCW 2022

作者： He, Pengfei Qi, Wenchao Liu, Xiaowei Liu, Linlin You, Dianlong Shen, Limin Chen, Zhen School of Information Science and Engineering Yanshan University Qinhuangdao China National Science Libraries Chinese Academy of Sciences Beijing China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao China

ISBN: (纸本)9789819923557

As more and more service providers encapsulate and publish their data and services on the internet in the form of Web APIs, the number of Web APIs is ever-increasing. For this reason, Web API recommendation is gaining momentum and has achieved high performance in accuracy. However, few studies paid attention to function recommendation. As an indispensable entity in the mashup-API ecosystem, function is not only the in-facto basis of API taxonomy, but also determines the compatibility and the internal construction pattern of mashup composition. Considering that users adopt multiple function invocations during a development cycle and the number of functions is also increasing, we propose the complementary function recommendation(CFR), a function-to-function problem. To solve the CFR, we regard each mashup as a transaction set for frequent pattern mining and propose an association rule-based complementary function recommendation(ARCFR) system, which provides function recommendation and corresponding probability explanation. Our experiments show that ARCFR can recommend complementary function effectively, and we give two applicable scenarios to demonstrate the practical value of our method in more aspects. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

Towards self-interpretable review spammer group detection

引用

Information Sciences 2025年 716卷

作者： Huo, Chenghang Zhang, Fuzhi School of Information Science and Engineering Yanshan University Hebei Province Qinhuangdao China Hebei Key Laboratory of Computer Virtual Technology and System Integration Hebei Province Qinhuangdao China

Due to data imbalance, existing spammer group detection methods often yield suboptimal performance. Moreover, many of these approaches operate as black boxes, offering little to no interpretability for their detection results. To address these issues, we propose a self-interpretable approach for detecting review spammer groups. Our method begins by constructing a user-product bipartite graph with edge attributes. We integrate user review information with a novel fitness function to develop an adaptive genetic algorithm that effectively identifies high-quality candidate groups. Next, we introduce a hybrid graph neural network enhanced with active learning to generate vector representations of these candidate groups. We then design and construct a prototype layer and a group classification layer to detect spammer groups accurately. To provide interpretability, we incorporate prototype learning to create an interpretation mechanism that explains detection outcomes. Experimental results demonstrate that our method achieves substantial improvements in Precision@k and Recall@k at the top-1000 ranking, outperforming state-of-the-art solutions on the Amazon, YelpChi, YelpNYC, and YelpZip datasets by [11.53 %, 97.36 %, 51.37 %, 32.06 %] and [12.65 %, 54.65 %, 64.19 %, 47.37 %], respectively. Additionally, the Fidelity of our interpretability results under varying Sparsity levels is approximately 4 %, 9 %, 8 %, and 8 % higher than those of existing methods on the same datasets. © 2025 Elsevier Inc.

关键词： Active learning

来源：评论

学校读者我要写书评

暂无评论

Semantic recommendation through Reinforcement Learning and weighted meta-paths

Semantic recommendation through Reinforcement Learning and w...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：