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

New construction of quaternary sequence pairs with even period

Journal of Information and Computational Science 2014年第13期11卷 4613-4621页

作者： Jia, Yanguo Shi, Yan Duan, Xiaobei Shen, Xiumin Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province School of Information Science and Engineering Yanshan University Qinhuangdao China

In the paper, we present a new method for constructing a class of quaternary sequence pairs with even period 2N from the known binary sequence pairs with odd period N by using the reverse Gray mapping and interleaving technique. The distribution of correlation function of the proposed quaternary sequence pairs is also derived, which is decided by the properties and the periods of the known binary sequence pairs. Copyright © 2014 Binary Information Press.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Robust recommendation algorithm based on the identification of suspicious users and matrix factorization

引用

Journal of Information and Computational Science 2014年第13期11卷 4769-4777页

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

The existing recommendation algorithms have lower robustness against shilling attacks. With this in mind, in this paper we propose a robust recommendation algorithm based on the identification of suspicious users and matrix factorization. We first give the computational methods of Deviation Degree about the Number of Ratings (DDNR) and Average Similarity of Neighbors (ASN) according to the distribution of users' ratings. Then we identify suspicious users based on the differences of computational results of users' DDNR and ASN. Finally, we introduce the matrix factorization technology which incorporates indicator function and the identification results of suspicious users to make recommendations for users. Experimental results show that the proposed algorithm not only improves the recommendation accuracy, but also has better robustness. Copyright © 2014 Binary Information Press.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Efficient subtree results computation for XML keyword queries

引用

Frontiers of computer Science 2015年第2期9卷 253-264页

作者： Ziyang CHEN School of Information Science and Engineering Yanshan University Hebei 066004 China Environmental Management College of China Hebei 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province Yanshan University Hebei 066004 China

In this paper, we focus on efficient construction of restricted subtree （RSubtree） results for XML keyword queries on a multicore system. We firstly show that the perfor- mance bottlenecks for existing methods lie in 1） computing the set of relevant keyword nodes （RKNs） for each subtree root node, 2） constructing the corresponding RSubtree, and 3） parallel execution. We then propose a two-step generic top-down subtree construction algorithm, which computes SLCA/ELCA nodes in the first step, and parallelly gets RKNs and generates RSubtree results in the second step, where generic means that 1） our method can be used to compute dif- ferent kinds of subtree results, 2） our method is independent of the query semantics; top-down means that our method con- structs each RSubtree by visiting nodes of the subtree con- structed based on an RKN set level-by-level from left to right, such that to avoid visiting as many useless nodes as possible. The experimental results show that our method is much more efficient than existing ones according to various metrics.

关键词： XML SLCA/ELCA RSubtree RKNs parallel

来源：评论

学校读者我要写书评

暂无评论

iBole： A Hybrid Multi-Layer Architecture for Doctor Recommendation in Medical Social Networks

引用

Journal of computer Science & technology 2015年第5期30卷 1073-1081页

作者：宫继兵王立立孙胜涛彭思维 School of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao 066004 China

In this paper, we try to systematically study how to perform doctor recommendation in medical social net- works （MSNs）. Specifically, employing a real-world medical dataset as the source in our work, we propose iBole, a novel hybrid multi-layer architecture, to solve this problem. First, we mine doctor-patient relationships/ties via a time-constraint probability factor graph model （TPFG）. Second, we extract network features for ranking nodes. Finally, we propose RWR- Model, a doctor recommendation model via the random walk with restart method. Our real-world experiments validate the effectiveness of the proposed methods. Experimental results show that we obtain good accuracy in mining doctor-patient relationships from the network, and the doctor recommendation performance is better than that of the baseline algorithms： traditional Ranking SVM （RSVM） and the individual doctor recommendation model （IDR-Model）. The results of our RWR-Model are more reasonable and satisfactory than those of the baseline approaches.

关键词： doctor recommendation architecture random walk with restart doctor-patient tie mining time-constraintprobability factor graph model medical social network

来源：评论

学校读者我要写书评

暂无评论

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卷

作者： Haixing Wu Shunfu Jin School of Information Science and Engineering Yanshan University Qinhuangdao 066004 PR China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao 066004 PR 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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A metadata extraction approach from papers based on meta-learning

引用

Journal of Information and Computational Science 2013年第4期10卷 1121-1129页

作者： Zhang, Fuzhi Zhao, Zihao School of Information Science and Engineering The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao 066004 China

To improve the accuracy of paper metadata extraction, a paper metadata extraction approach based on meta-learning is presented. Firstly, we propose a construction method of base-classifiers, which combines the Support Vector Machine (SVM) with the created diverse base-level training sets to construct some base-classifiers with larger diversity. The training sets are created according to the Open Access (OA) journal categories. Secondly, we present a paper metadata extraction algorithm based on meta-learning, which uses the meta-classifier to integrate the classification results of the base-classifiers and generates the final extraction results. The proposed approach guarantees extraction accuracy and independence of the base-classifiers, increases the diversities of them, and improves the classification performance of the meta-classifier, as well as reduces the degree of correlation of misclassifications. The experimental results show that our approach is superior to other single machine learning algorithm and the accuracy of paper metadata extraction is improved. © 2013 by Binary Information Press.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Commodity dynamic pricing and inventory joint decision-making model based on specific power demand function

引用

Revista Tecnica de la Facultad de Ingenieria Universidad del Zulia 2016年第4期39卷 74-81页

作者： Sun, Dejie Liu, Wenyuan Zhang, Jie School of Information Science and Engineering Yanshan University Qinhuangdao Hebei066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao Hebei066004 China

Dynamic pricing and inventory play a respective role. The purpose of inventory is to try best to maintain an even production speed and efficiently ease supply-and-demand contradiction during the production process and among enterprises in the supply chain. However, dynamic pricing aims at maximizing revenues by setting commodities or services at different price levels according to diversified demands of consumers and different commodity or service price evaluation by consumers in different periods. Therefore, it is important for enterprises to optimize their dynamic pricing strategies and commodity inventory so as to maximize value of researches. However, demands for tangible commodities are uncertain. Generally speaking, the commodity demand volume should first be confirmed before any specific analysis. Therefore, this paper focuses on introducing the commodity demand function and relevant factors influencing the commodity demand volume. The utility function describing consumers' demands for a single commodity is analyzed. The specific power demand function model based on utility maximization is built through the utility function. At last, we conduct an in-depth analysis and simulation of the model.

关键词： Economics

来源：评论

学校读者我要写书评

暂无评论

Software fault localization via mining program dynamic execution graph

引用

Journal of Computational Information systems 2014年第19期10卷 8563-8573页

作者： Zhang, Kai Yang, Ke Zhou, Lianbo Ren, Jiadong College of Information Science and Engineering Yanshan University Qinhuangdao China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

This paper is concerned with the problem of locating the code area related to software potential fault quickly and accurately in software testing period. A new method Sig BB based on graph model is proposed for mining the suspicious fault nodes from the passing and failing execution graphs. Representing each execution of a program as a graph, the graphs are divided into the passing and failing sets. By extracting the most representative passing and failing graphs based on these sets, the discriminative sub-graph is mined between the two representative graphs. First, Sig BB searches the max common graph, and then gets the opposite nodes set. The discriminative sub-graph is obtained by organizing and extending the set finally. Since the detected code scale is associated with the sorting of suspicious nodes, a suspicious metric strategy is also designed to sort the nodes in the discriminative sub-graph. Experimental results indicate that our method is both effective and efficient for software fault localization.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

New friend recommendation with user interest and socialization

引用

Journal of Information and Computational Science 2015年第11期12卷 4253-4262页

作者： Huang, Guoyan Chang, Yixin Li, Yakun College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

Friend recommendation is popular in social site to help people make new friends and expand their social networks. However, the conventional friend recommendation method is low accuracy for the sparsity of data and cold start. To solve this problem, we propose a new personalized recommendation method with user interest and socialization. This approach incorporating user interest and social information mainly leverages both user-based collaborative filtering method and user topological structure in social networks. Firstly, user interest degree can be obtained to identify the user preferences. Secondly, get the new optimized similarity degree and the target user's nearest neighbor by using social collaborative filtering algorithm. In the end, the final recommendation set of user can be acquired from the highest predicted rating of the candidate collection. The experiments indicate that this proposed method can enhance the Effectiveness and accuracy of recommendation compared with the traditional friend recommendation algorithm. ©, 2015, Binary Information Press. All right reserved.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Road network information based edge bundling

引用

Journal of Information and Computational Science 2015年第13期12卷 4909-4918页

作者： Nie, Junlan Zhang, Jikai Xin, Shuyue Guo, Dongliang College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

To solve edge confusion problems in the geo-related graph visualization, here we present an edge bundling algorithm based on the road network information. First, the improved Dijkstra shortest path algorithm is employed to calculate the related path of original edges, and slicing quadratic Bezier curves are fitted out to replace original edges according to these path information. And then, the curve segments that satisfy conditions are merged together according to the control point consolidation strategy and thickened according to their weights, which simplifies the bundling result and also effectively shows the heat of each path;Finally, for the interested curves in the human-computer interaction, highlighted transition colors are introduced to character their directivity, and the effect is intuitive. The experimental results show that, our algorithm can effectively bundle original edges, which reduces the confusion degree of the graph. Meanwhile, the bundling result is more close to the original path, which improves the readability and understandability of the graph effectively. ©, 2015, Journal of Information and Computational Science. All right reserved.

关键词： Human computer interaction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：