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

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

来源：评论

学校读者我要写书评

暂无评论

In-rank: An entropy-based informative nodes mining method in complex software network

引用

ICIC Express Letters 2016年第7期10卷 1683-1689页

作者： Ren, Jiadong Li, Yanling Wu, Hongfei Liu, Yang Zhang, Peng College of Information Science and Engineering Yanshan University No. 438 Hebei Avenue Qinhuangdao066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Avenue Qinhuangdao066004 China

It is a fundamental issue to find a small subset of influential individuals in a complex network such that they can spread information to the largest scope of nodes in the network. Informative functions in complex software network can lead maximum information propagation scope, and mining such function nodes is important to understand the system’s topology structure and information transfer flows. In this paper, a novel topk informative nodes mining approach based on global information in directed-weighted complex software network is proposed. Firstly, we map functions and call relationships between them as a Directed-Weighted Function Call Network (DWFCN). Secondly, an algorithm path-compute based on Software Executing Path Sequence (SEPS) generated by Depth-First-Search strategy is used to compute the software executing paths and get nodes’ information Accessible Set (AS). Thirdly, algorithm Entropy-Compute is proposed to calculate each source node’s information entropy in each information transfer flow process. Finally, an Informative Node Rank (IN-Rank) algorithm is put forward to mine most informative nodes. Experimental results show that our new method is accurate and effective. © 2016, ICIC Express Letters Office. All rights reserved.

关键词： Mining

来源：评论

学校读者我要写书评

暂无评论

Fast optical wavefront engineering for controlling light propagation in dynamic turbid media

引用

Journal of Innovative Optical Health Sciences 2019年第4期12卷 46-66页

作者： Meiyun Xia Deyu Li Ling Wang Daifa Wang School of Biological Science and Medical Engineering Beihang University Beijing100083P.R.China Beijing Advanced Innovation Center for Biomedical Engineering Beihang University Beijing100083P.R.China State Key Laboratory of Virtual Reality Technology and System Beihang University Beijing100083P.R.China College of Computer Science Sichuan Normal University Chengdu610101P.R.China

While propagating inside the strongly scattering biological tssue,photons lose their incident directions beyond one transport mean free path(TMFP,~1 millimeter(mm)),which makes it challenging to achieve optical focusing or clear imaging deep inside *** manipulating many degrees of the incident optical wavefront,the latest optical wavefront engineering(WFE)technology compensates the wavelfront distortions caused by the scattering media and thus is toward breaking this physical limit,bringing bright perspective to many applications deep inside tissue,eg,high resolution functional/molecular imaging,optical excitation(optogenetics)and optical ***,inside the dynamic turbid media such as the biological tissue,the wavefront distortion is a fast and continuously changing process whose decorrelation rate is on timescales from milliseconds(ms)to microseconds(μs),or even *** requires that the WFE technology should be capable of beating this rapid *** this review,we discuss the major challenges faced by the WFE technology due to the fast decorrelation of dynamic turbid media such as living tissue when achieving light focusing/imaging and summarize the research progress achieved to date to overcome these challenges.

关键词： Fast wavefront engineering optical phase conjugation feedback-based iterative wavefront optimization transmission matrix decorrelation time

来源：评论

学校读者我要写书评

暂无评论

Improved BP classifier via distance for sample reduction

引用

Journal of computers (Taiwan) 2019年第2期30卷 1-13页

作者： Wen, Jia Deng, Jia Liu, Peng-Fei Wang, Hong-Jun Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao China School of Information Science and Engineering Yanshan University Qinhuangdao China State Key Laboratory of Software Engineering of Hebei Province Yanshan University Qinhuangdao China

The BP neural network algorithm is a commonly used technique in the classification field of pattern recognition, which iterates training samples continuously to obtain the decision boundary, until the error reaches the convergence precision. However, due to the extensive redundancy of training samples, this carpet-like training method can easily lead to slow network convergence and low classification performance. In this paper, from the view of sample, a novel BP training method called improved BP Classifier algorithm using Distance for Sample Reduction (DRBP) is proposed. Through the sample weight to get the new training sample, which are the near of the classification interface like support vector, and then iterative training BP classifier to solve the classification issue. The main function of this method is to keep the original sample information, realize the sample reduction, and improve the generalization ability of the BP neural network. First, point sets is used to visualize the training process. And then use 10 sets of the University of California Irvine (UCI) to verify the effectiveness and superiority of our experiments. Finally through Cross-validation, the classification error rate of 10 sets of UCI datasets tested by DRBP training method is lower than that of standard BP neural network (STBP). So the result of the experiment showed that the method of the combined distance sample reduce with BP network can significantly enhance the generalization ability of BP network. © 2019 computer Society of the Republic of China. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Using GPU to Accelerate Cache Simulation

Using GPU to Accelerate Cache Simulation

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Wan Han Gao Xiaopeng Wang Zhiqiang Li Yi State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Engineering Beijing Aeronautics and Astronautics University Beijing China

Caches play a major role in the performance of high speed computer systems. Trace driven simulator is the most widely used method to evaluate cache architectures. However, as the cache design moves to more complicated architectures, along with the size of the trace is becoming larger and larger. Traditional simulation methods are no longer practical due to their long simulation cycles. Several techniques have been proposed to reduce the simulation time of sequential trace driven simulation. This paper considers the use of generic GPU to accelerate cache simulation which exploits set partitioning as the main source of parallelism. We develop more efficient parallel simulation techniques by introducing more knowledge into the Compute Unified Device Architecture (CUDA) on the GPU. Our experimental result shows that the new algorithm gains 2.76 times performance improvement compared to traditional CPU based sequential algorithm.

关键词： Acceleration Computational modeling computer architecture Analytical models Concurrent computing computer simulation High performance computing Parallel processing Parallel algorithms Distributed processing

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

International Conference on computer Supported Cooperative Work in Design

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

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 collaborative filtering. However, employing collaborative 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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Detecting Abnormal Activities in Video Surveillance with multi-Models

Detecting Abnormal Activities in Video Surveillance with mul...

引用

2008 5th International Conference on Visual Information Engineering (VIE 2008)

作者： Xiu-xiu Li Jiang-bin Zheng Jian-min Wu Guo-feng Hou School of Computer Northwestern Polytechnical University Xi'an Shaanxi China National Defense Science and Technology key laboratory for Avionics System Integration Technology China

In this paper, an adaptive method for detecting abnormal activities in video surveillance is proposed. In this method, a multi-Gaussian distribution called activity model is used to model a moving object activities. The activity model parameters are updated to satisfy the object motion attributes in a real-time when every new frame comes, and at same time this moving object current activity can be recognized by means of its possibility in the activity model. The advantage of this method is that the proposed activity models can update itself adaptively to match the current motion style of the object. The models are robust to the light change in the style of the object activity, and they are sensitive to these activities that do not meet the models. Several experiments are given to show that the proposed method is efficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

引用

International Journal of Advancements in Computing technology 2012年第19期4卷 213-222页

作者： Dong, Jun Chen, Shuai Chen, Jing Huang, Guoyan Ren, Jiadong College of Information Science and Engineering Yanshan University 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China Production Management Department Shanghai Aircraft Manufacturing Co.Ltd 200436 China

Algorithms based on row enumeration always scan and construct conditional transposed tables, which increases the execution time and space cost. To address this problem, we adopt the DAG (Directed Acyclic Graph) to compress the dataset to save the memory space. In DAG, each node is related to a rowid, and each two nodes have a corresponding directed edge which stores the common items of the two rowids. Each row is given an integer according to its coming order and the DAG follows that order. A directed acyclic graph records the relation between rows and items by doing AND(&) operation with the nodes' binary code of the edges. We also present DAGHDDM which is a new approach for mining frequent closed itemsets in high dimensional datasets. In this algorithm, we adopt the BitTable to compress the dataset firstly, and then construct DAG according to the BitTable. We increase the same items of the adjacent edges to implement pattern growth, traverse the DAG in reversal way and adopt a close-checking method to generate all frequent closed itemsets. It scans the dataset only once and does not generate candidate itemsets. The experimental results show that the proposed DAGHDDM algorithm can decrease the cost of time.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

An efficient collision detection algorithm of convex polygons based on Minkowski sum

引用

ICIC Express Letters 2013年第2期7卷 461-464页

作者： Geng, Qingjia Guo, Xijuan Zhang, Jianfei Zhang, Buying The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China College of Computer Hebei Normal University of Science and Technology No. 360 West Hebei St. Qinhuangdao 066004 China

Collision detection is a hot research topic in the field of path planning of mobile robot, virtual assembly simulation, and so on. Fast and accurate collision detection has become one of the most key technologies of restricting their development. The study method based on Minkowski sum is an effective method for accurate collision detection through accurate numerical calculations. This paper presents a new efficient collision detection algorithm of convex polygons based on Minkowski sum, which uses the minimum separation distance to detect whether two convex polygons collide or not. The algorithm's performance is also analyzed and verified by experiment in the paper. Compared with the traditional collision detection algorithms based on the Minkowski sum, the algorithm's calculation is simpler and execution performance is higher. © 2013 ISSN 1881-803X.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：