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

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

来源：评论

学校读者我要写书评

暂无评论

Influence maximization in MicroBlog based on a new user influence ranking method

引用

Journal of Information and Computational Science 2015年第9期12卷 3729-3737页

作者： Liu, Yuanying Guo, Jingfeng Hu, Xinzhuan Liu, Miaomiao Zhang, Jilong College of Information Science and Engineering Yanshan University Qinhuangdao China College of Information Technology Hebei University of Economics and Business Shijiazhuang China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

The characteristics of the MicroBlog data are analyzed firstly. Then WeiBo graph is constructed through tweets forwarded path and user influence ranking calculation method which according to the classic PageRank is given;the initial value of user influence ranking concludes three attributes, such as followers' number, tweets' number and recent tweets' quality. Maximization algorithm in MicroBlog based on user influence ranking is put forward finally. Experiments show that this maximization algorithm is superior to the others in spread scope. ©, 2015, Journal of Information and Computational Science. All right reserved.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

Multi-label feature selection with feature reconstruction and label correlations

引用

Expert systems with Applications 2025年 285卷

作者： Ning Zhang Ao Wang Pengwei Lu Tao Feng Ying Xu Guodong Du School of Information Science and Engineering Yanshan University Qinhuangdao 066004 PR China Hebei Key Laboratory of Computer Virtual Technology and System Integration Yanshan University Qinhuangdao 066004 PR China Department of Computer Science and Technology Tsinghua University Beijing 100084 PR China Shenzhen Research Institute of Yanshan University Shenzhen 518063 PR China

With the arrival of the big data era, multi-label data have frequently appeared in various fields. However, multi-label data often contain rich feature information, leading to a high-dimensional feature space. Thus, multi-label feature selection plays a crucial role in addressing this challenge as a preprocessing step. Multi-label data assign a set of labels to each instance simultaneously; therefore, capturing the correlations among labels is an effective means of enhancing the learning performance. However, current multi-label feature selection methods seldom consider label correlations. Moreover, redundant features can cause overfitting, increase the complexity, and reduce the interpretability. To address these issues, we propose a multi-label feature selection method that incorporates feature reconstruction and label correlations. Specifically, we construct a low-dimensional embedding from the original feature space using induction, which preserves the manifold structure of the feature space. Next, we explore the global and local label correlations using a manifold regularization term designed by the generated low-dimensional space. We then achieve feature reconstruction by minimising the reconstruction error and sparse regularization terms to learn the relationships between the features. Finally, we construct an optimal objective function with ℓ 2 , 1 -norm regularization to facilitate multi-label feature selection and ensure convergence. Comparative experiments on 11 datasets show that the proposed method exhibits notable performance improvements over existing methods(e.g., achieves 5.6 % higher Average precision than RFS on S c e n e and 3.6 % lower Coverage than CRASG on S c i e n c e ), validating the effectiveness and superiority of the proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A load balancing algorithm for multi-root ONS

引用

Journal of Computational Information systems 2014年第7期10卷 2735-2742页

作者： Hao, Fengzhai Liu, Yongshan Chen, Wei College 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 Data Industry Research Lab. Qinhuangdao 066004 China

In order to solve the overload problem of root ONS in the EPC network, a load balancing algorithm based on multi-root ONS is proposed. Based on the proposed load balancing ONS (LB ONS) architecture, the ONS Root is defined to have two states, idle or busy. According to CPU utilization and memory utilization of the ONS Root and in combination with threshold controlling to periodically update the ONS Root states, which makes the requests coming from client applications be transferred to an ONS Root which is idle. Experiment results show that the algorithm can reduce query hops and query delays effectively and offer lookup service efficiently. © 2014 Binary Information Press.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Edge collapse mesh simplification algorithm based on detail features preserving

引用

Journal of Computational Information systems 2014年第7期10卷 2883-2890页

作者： Jia, Qi Liu, Yongshan Gu, Xiaoying College 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 Data Industry Research Lab. Qinhuangdao 066004 China

The existing model simplification algorithm in simplified speed and quality can't reach a better compromise, so we present an improved quadric error metrics edge collapse mesh simplification algorithm. This algorithm makes the local region unevenness of vertex, the local region average area of vertex and edge length as constraint factors add to the edge collapse cost, by changing the order of the edge collapse to retain the important detail features of the original model. New vertex position is calculated on the different types of edge, keeping the boundary characteristics of the mesh model. Experimental results show that the improved algorithm not only runs faster, but also maintains a higher degree on the model feature region. © 2014 Binary Information Press.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Real-time simulation of foam and sprays based on the Weber number

引用

Journal of Computational Information systems 2014年第7期10卷 2829-2836页

作者： Zhang, Lihui Zhang, Chao Li, Ying Lv, Mengya Tang, Yong The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province The College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China Department of Information Engineering Environmental Management College of China Qinhuangdao 066004 China

In this paper, we propose a method based on the Weber number to uniformly model and simulate the foam and sprays generated by the fluid motion. We use the SPH to construct the fluid and calculate the Weber number of each particle. The fluid particles are divided into foam particles, transition particles and water particles by comparing their Weber number with a given critical value. These particles are rendered independently. For the solid-liquid interaction in fluid, we use SPH particles to mark the solid shape, and correct the changed solid particle position using a rotating equation. Finally, a more precise fluid surface illumination model is proposed, and the Fresnel reflection coefficient of this model can be gotten by the Snell law. Experiment results show that our method achieve real-time performance and the visual effect is desirable. © 2014 Binary Information Press.

关键词： Hydrodynamics

来源：评论

学校读者我要写书评

暂无评论

Adaptive multilevel meshes for cloth simulation

引用

Journal of Information and Computational Science 2014年第11期11卷 3865-3872页

作者： Zhao, Jing Pei, Shanshan Lv, Mengya Li, Ying Tang, Yong Yang, Meiling Zhang, Mingmin Pan, Zhigeng The 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 The College of Computer Science and Technology Zhejiang University Hangzhou China Institute of Service Engineering Hangzhou Normal University Hangzhou China

A novel method based on multilevel meshes is proposed to simulate the cloth draping process rapidly on a complex model. Considering of the difficulty of computing the realtime collision between cloth and complex models by normally methods, the draping process of cloth is divided into several phases and at each phase the mesh size is smaller than its previous one. The optimized 1-to-4 split is used to drive the rapid changes in the grid hierarchy and to simplify the calculations. We choose the widely used ellipsoid as the bounding cell to enclose the complex models in the environment. The ellipsoid avoids the complex structure of hierarchical bounding box and eliminates the impossible collision model area rapidly. Experiments demonstrate that this method can accelerate the draping process of cloth and decrease the number of iterations and the calculation of collision detection. Further mesh refinement improves the reality of cloth when it reaches the final position and ensures the realism of the simulation in real time. ©2014 Binary Information Press

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

A RIHS-tree-based algorithm of mining frequent closed itemsets in high dimensional datasets

引用

Journal of Convergence Information technology 2012年第21期7卷 467-476页

作者： Huang, Guoyan Chen, Shuai Ren, Shenyuan Dong, Jun College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China College of Computer Science Sichuan University Chengdu Sichuan 610000 China

In order to fully utilize the minimum support threshold to prune the rowset search space and avoid scanning the whole dataset in close-checking, we proposed two new data structure, Rowset-Itemset-Hybrid-Search-Tree (RIHS-Tree) and Frequent-Closed-Itemset-Rowset-Tree (FCIR-Tree). The former stores the rowsets which share common rowid prefixes, according to some predefined order of rowids. Each path from the root node to the leaf node represents a rowset in which the rowids increase. The later also stores the large rowsets which also share common rowid prefixes. The corresponding closed itemsets are stored in the nodes carrying the last rowids in rowsets. Moreover, a new algorithm, RIHS-Tree-based algorithm for mining frequent closed patterns (FCIM-RIHS), is proposed. We translate the whole dataset into a transposed table, construct RIHS-Tree according to the rowsets in the transposed table and use a bottom-up search strategy to traverse RIHS-Tree. In the process of mining, we use the rowsets-inclusion strategy to implement pattern growth and then obtain large rowsets with their corresponding frequent closed itemsets. In FCIR-Tree, if the nodes in the subtree rooted by the nodes carrying the last rowid in the rowsets do not contain the found itemsets, the found itemsets are frequent closed itemsets. The experiment results with dataset demonstrate that FCIM-RIHS has highly efficiency.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Communication-Based Attacks Detection in Android Applications

引用

Tsinghua Science and technology 2019年第5期24卷 596-614页

作者： Chuan Ma Tao Wang Limin Shen Dongkui Liang Shuping Chen Dianlong You School of In formation Science and Engineering Yanshan University the Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China School of Business Ad mi nisliatiom Hebei Normal University of Science and Technology. Qinhuangdao 066004 China Library of Yanshan University. Yanshan University Qinhuangdao 066004 China

The Android operating system provides a rich Inter-Component Communication(ICC) method that brings enormous convenience. However, the Android ICC also increases security risks. To address this problem, a formal method is proposed to model and detect inter-component communication behavior in Android applications. Firstly,we generate data flow graphs and data facts for each component through component-level data flow ***, our approach treats ICC just like method calls. After analyzing the fields and data dependencies of the intent, we identify the ICC caller and callee, track the data flow between them, and construct the ICC model. Thirdly,the behavior model of Android applications is constructed by a formal mapping method for component data flow graph based on Pi calculus. The runtime sensitive path trigger detection algorithm is then given. Communicationbased attacks are detected by analyzing intent abnormity. Finally, we analyze the modeling and detection efficiency,and compare it with relevant methods. Analysis of 57 real-world applications partly verifies the effectiveness of the proposed method.

关键词： Android inter-component communication intents component hijacking attack detection

来源：评论

学校读者我要写书评

暂无评论

A novel grouping aggregation algorithm for online analytical processing

A novel grouping aggregation algorithm for online analytical...

引用

2012 National Conference on Information technology and computer Science, CITCS 2012

作者： Chen, Wei Liu, Yongshan Wang, Ning College of Information Science and Engineering Yanshan University Qinhuangdao China Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province Qinhuangdao China

ISBN: (纸本)9789491216381

As regard to improve the efficiency of grouping aggregation calculation, the data is compressed by using binary encoding, and the dimension hierarchical grouping attribute set encodings of each dimension table are calculated by using the dimension hierarchy tree. Then different encodings are put into temporary table to be sorted and grouped, and the grouping sequence numbers of fact table records which satisfy the query conditions are computed. Finally, the buffer is located by the grouping sequence number and the grouping aggregation calculation is completed. Theoretical analysis and experimental results show that the proposed algorithm can significantly improve the efficiency of grouping aggregation calculation. © 2012. The authors - Published by Atlantis Press.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：