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

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)

来源：评论

学校读者我要写书评

暂无评论

Collosion detection research based on capsule bounding volume

引用

Journal of Computational Information systems 2014年第7期10卷 2743-2750页

作者： Kong, Dehan Liu, Yongshan Cui, Na Department of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China The Data Industry Research Lab. Qinhuangdao 066004 China

A collision detection algorithm based on capsule bounding volume (CBV for short) is presented improve the efficiency of Collision detection in three-dimensional scene. This algorithm use CBV to encircle roles and achieve collision detection between the virtual characters and static objects and dynamic objects in the scene. It includes collision detection between CBV and AABB, triangular and capsule. Theoretical analysis and experimental results show that this algorithm can improve real time for collision detection. © 2014 Binary Information Press.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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 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

来源：评论

学校读者我要写书评

暂无评论

A PSO Based Multi-Domain virtual Network Embedding Approach

引用

China Communications 2019年第4期16卷 105-119页

作者： Yongjing Ni Guoyan Huang Sheng Wu Chenxi Li Peiying Zhang Haipeng Yao College of Information Science and Engineering Yanshan University College of Information Science and Engineering Hebei University of Science and Technology The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University School of Information and Communication Engineering Beijing University of Posts and Telecommunications College of Computer & Communication Engineering China University of Petroleum (East China)

This paper proposed a multi-domain virtual network embedding algorithm based on multi-controller SDN architecture. The local controller first selects candidate substrate nodes for each virtual node in the domain. Then the global controller abstracts substrate network topology based on the candidate nodes and boundary nodes of each domain, and applies Particle Swarm Optimization Algorithm on it to divide virtual network requests. Each local controller then embeds the virtual nodes of the divided single-domain virtual network requests in the domain, and cooperates with other local controllers to embed the inter-domain virtual links. Simulation experimental results show that the proposed algorithm has good performance in reducing embedding cost with good stability and scalability.

关键词： multi-domain virtual network embedding candidate node particle swarm optimization algorithm virtual network request division

来源：评论

学校读者我要写书评

暂无评论

Discriminative feature encoding for intrinsic image decomposition

引用

Computational Visual Media 2023年第3期9卷 597-618页

作者： Zongji Wang Yunfei Liu Feng Lu Key Laboratory of Network Information System Technology(NIST) Aerospace Information Research InstituteChinese Academy of SciencesBeijing 100190China State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and EngineeringBeihang UniversityBeijing 100191China Peng Cheng Laboratory Shenzhen 518000China

Intrinsic image decomposition is an important and long-standing computer vision *** an input image,recovering the physical scene properties is *** physically motivated priors have been used to restrict the solution space of the optimization problem for intrinsic image *** work takes advantage of deep learning,and shows that it can solve this challenging computer vision problem with high *** focus lies in the feature encoding phase to extract discriminative features for different intrinsic layers from an input *** achieve this goal,we explore the distinctive characteristics of different intrinsic components in the high-dimensional feature embedding *** define feature distribution divergence to efficiently separate the feature vectors of different intrinsic *** feature distributions are also constrained to fit the real ones through a feature distribution *** addition,a data refinement approach is provided to remove data inconsistency from the Sintel dataset,making it more suitable for intrinsic image *** method is also extended to intrinsic video decomposition based on pixel-wise correspondences between adjacent *** results indicate that our proposed network structure can outperform the existing state-of-the-art.

关键词： intrinsic image decomposition deep learning feature distribution data refinement

来源：评论

学校读者我要写书评

暂无评论

A PTV method based on SIFT feature points matching for velocimetry measurement of oil-water two-phase flow in horizontal pipelines

International Journal of Signal Processing, Image Processing...

引用

International Journal of Signal Processing, Image Processing and Pattern Recognition 2015年第12期8卷 195-206页

作者： Kong, Weihang Li, Lei Kong, Lingfu Li, Yingwei Xie, Na School of Information Science and Engineering Yanshan University QinhuangdaoHebei China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Hebei China Information Department of Library Yanshan University QinhuangdaoHebei China

Due to the advantages of scale invariant feature transform (SIFT) feature points on the invariant to image scale, brightness, rotation, occlusion, noise and so on, this paper proposes a Particle Tracking Velocimetry (PTV) method, based on SIFT feature points matching for velocity measurement of oil-water two-phase flow in horizontal pipelines. The oil-water two-phase flow with large droplet diameter, oil droplets overlap, ununiform lighting, and the centroid position of oil droplets can’t be obtained only by using traditional PTV methods through morphological processing. However, in this paper, the algorithm can directly achieve the average velocity of the flow field according to the positions of correctly matched SIFT feature points, and there is no need to extract the centroid coordinates of each oil droplet. The experimental results show that the proposed algorithm not only can be used in the average velocity measurement of oil-water two- phase flow in horizontal pipelines, but also can reach 95% in the measuring accuracy when the matching feature points are enough sufficient. © 2015 SERSC.

关键词： Velocity measurement

来源：评论

学校读者我要写书评

暂无评论

Research on Software Community Division Method Based on Inter-node Dependency 16th

Research on Software Community Division Method Based on Inte...

引用

16th International Conference on Intelligent Computing, ICIC 2020

作者： Dong, Jun Hao, Chengqian Ren, Jiadong Lu, Haitao College of Information Science and Engineering Yanshan University Qinhuangdao066000 China The Key Computer Virtual Technology and System Integration Laboratory of Hebei Province Qinhuangdao066000 China

ISBN: (纸本)9783030607982

The mining of software community structure is of great significance in identifying software design pattern, software maintenance, software security and optimizing software structure. To improve the accuracy of description of software execution status model, A new method to construct merge software execute graph is proposed that based on the software execution network model. And then to get the software execution path through the software execution sequence analysis, The ND (Node Dependence) was proposed to measure the tightness of inter-node dependencies based on the design principle of "high cohesion, low coupling" of software. At last, depends on the software execution path, the SLCA (Software Label Communities Algorithm) community division algorithm is proposed to improve stability of community partition algorithm and validity of software module partition. © 2020, Springer Nature Switzerland AG.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：