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

Occlusion avoidance approach based on depth image of visual object

ICIC Express Letters, Part B: Applications 2015年第11期6卷 3103-3108页

作者： Zhang, Shihui Sang, Yu Zhang, Xiaojun School of Information Science and Engineering Yanshan University No. 438 Hebei Avenue Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province No. 438 Hebei Avenue Qinhuangdao China E and A College Hebei Normal University of Science and Technology No. 360 West Hebei Street Qinhuangdao China

Occlusion avoidance is a more challenging problem in visual field. An occlusion avoidance approach based on depth image of visual object is proposed in this paper. Firstly, the occlusion detection is implemented for the depth image of visual object in current view, and then the occlusion boundary and nether adjacent boundary are obtained to construct occlusion region. Secondly, the occlusion region is segmented into several sub-regions by connecting the corner of occlusion boundary with its nether adjacent boundary point, and the triangular mesh model of each sub-region is established. Thirdly, the candidate observation direction set is determined by utilizing the normal vector of each triangle in triangular mesh model. Finally, the next best view is confirmed based on the candidate observation direction set to realize the occlusion avoidance function. Compared with the existing methods, the proposed approach does not need the priori knowledge of visual object or limit the camera position on a fixed surface. Experimental results demonstrate its feasibility and effectiveness. © 2015 ICIC International.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Specifying safety and liveness of semi-algebraic transition systems

引用

Journal of Computational information Systems 2015年第2期11卷 457-465页

作者： Fu, Jun Wu, Jinzhao Tan, Hongyan Zhou, Ning School of Computer and Information Technology Beijing Jiaotong University Beijing China Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis Guangxi University for Nationalities Nanning China High Performance Network Lab. Institute of Acoustics Chinese Academy of Sciences Beijing China School of Electronic and Information Engineering Lanzhou Jiaotong University Lanzhou China

We present an approach to specification of properties of semi-algebraic transition systems which are introduced as mathematical structures for modeling complex physical systems. We extend dynamic logic to the semi-algebraic dynamic logic (SDL) which enlarges abstract modalities to polynomial expressions with inequalities and boolean connectives. In SDL, semi-algebraic transition systems are modeled as semi-algebraic programs. The semantics of SDL is constructed by interpreting the transition relation of semi-algebraic programs and the satisfaction of formulas with semi-algebraic sets. Hence, safety and liveness properties of semi-algebraic transition systems are well formulised as SDL formulas. Finally, our method of specifying complex systems is illustrated with three typical examples. 1553-9105/Copyright © 2015 Binary information Press

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Quantitative specification of semi-algebraic transition systems with metrics

引用

Journal of information and Computational Science 2015年第3期12卷 993-1000页

作者： Fu, Jun Wu, Jinzhao Tan, Hongyan Zhou, Ning School of Computer and Information Technology Beijing Jiaotong University Beijing China Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis Guangxi University for Nationalities Nanning China High Performance Network Lab Institute of Acoustics Chinese Academy of Sciences Beijing China School of Electronic and Information Engineering Lanzhou Jiaotong University Lanzhou China

We present semi-algebraic transition systems endowed with metrics, which extend traditional transition systems by combining semi-algebraic sentences and metrics for measuring the deviation of system behaviors. In order to specify the distance between behaviors, we present two metrics over states and trajectories of semi-algebraic transition systems, respectively. Accordingly, we give an intuitive description of approximate satisfaction of system properties expressed as semi-algebraic sentences. Furthermore, we propose a concise definition of approximate semi-algebraic transition systems. Finally, we summarize our work with a conclusion implying that a criterion satisfying the transferability on transitions is required, which aims to construct approximate semi-algebraic transition systems with respect to general metrics. ©, 2015, Binary information Press. All right reserved.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Mining weighted frequent traversal pattern from software executing graph

引用

ICIC Express Letters 2015年第11期9卷 2893-2900页

作者： He, Haitao Yin, Tengteng Pei, Caiyan Wu, Hongfei Ren, Jiadong College of Information Science and Engineering No. 438 West Hebei Ave. Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 West Hebei Ave. Qinhuangdao China School of Mathematics and Information Science and Technology Hebei Normal University of Science and Technology No. 360 West Hebei Street Qinhuangdao China

Mining important patterns in complex software executing network plays an important role in analyzing software security. The general sequential pattern mining algorithms may lead to poor performance due to the lack of consideration on the continuous property of software path traversals and the different importance of functions. To address the issue, a novel approach called weighted frequent traversal pattern miner (WFTPMiner) to mine weighted frequent traversal pattern from software executing graph is presented in this paper. In WFTPMiner, weighted software executing graph (WSEG) is modeled firstly. Secondly, software path traversals are extracted from WSEG by depthfirst- search (DFS) strategy. Thirdly, according to continuity characteristics of software path traversals, a potential frequent suffix sequence tree (PFSS-Tree) is defined to store the potential weighted frequent traversal patterns. A pruning strategy is adopted by PFSSTree. The pruning strategy can prune infrequent patterns effectively. The experimental results show that WFTPMiner has better efficiency compared with some previous algorithms. © 2015 ICIC International.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

An dynamic-weighted collaborative filtering approach to address sparsity and adaptivity issues

An dynamic-weighted collaborative filtering approach to addr...

引用

Congress on Evolutionary Computation

作者： Liang Gu Peng Yang Yongqiang Dong Ministry of Education Key Laboratory of Computer Network and Information Integration (Southeast University) Nanjing China

ISBN: (纸本)9781479914869

Recommendation systems, as efficient measures to handle the information overload and personalized service problems, have attracted considerable attention in research community. Collaborative filtering is one of the most successful techniques based on the user-item matrix in recommendation systems. Usually the matrix is extremely sparse due to the massive number of users and items. And the sparsity of users and items tends to differ significantly in degree. The feature of the matrix changes with the variation of users/items data and hence, leads to poor scalability of the recommendation method. This paper proposes a dynamic-weighted collaborative filtering approach (DWCF) to address sparsity and adaptivity issues. In this approach, the relationship between the distributions of similar users and items is considered to get better recommendation, i.e., the contributions of the user part and the item part to recommendation results depend on their similarity ratios. Moreover, the effect strength of different parts is controlled by an averaging parameter. Experiments on MovieLens dataset illustrate that the DWCF approach proposed in this paper can obtain good recommendation result given different conditions of data sparsity and perform better than a user-based predictor, an item-based predictor and a conventional hybrid approach.

关键词： Filtering Collaboration Accuracy Sparse matrices Computational modeling Feature extraction Estimation

来源：评论

学校读者我要写书评

暂无评论

Laser 728 nm Spectroscopy of Electrodeless Discharge Rb Lamp

引用

Chinese Physics Letters 2014年第12期31卷 23-26页

作者：刘忠征薛潇博牛富增张理国凌俐陈景标 State Key Laboratory of Advanced Optical Communication System and Network Institute of Quantum Electronics School of Electronics Engineering ~ Computer Science Peking University Beijing 100871 Institute of Information and Electronics Zhejiang University City College Hangzhou 310015

The electrodeless discharge rubidium vapor lamp plays a key role in a number of applications, such as atomic clock, atomic magnetometer, atomic optical filter and laser frequency stabilization. The electrodeless discharge Rb vapor lamp has rich spectra, including 420nm, 421nm, 565nm, 572nm, 607nm, 616nm, 728 nm, 776 nm, 780 nm, 795 nm, 1324 nm, 1344 nm, 1366 nm, 1475 nm, 1529 nm spectroscopy, etc. The 780nm transition wavelength between 5P3/2 and 5S1/2 of Rb atoms is usually used in fields of the Rb atomic clock and the Rb atomic *** the 421.7 nm laser pumping atoms from 5S1/2 to 6P1/2, 1366.9 nm transition from 6S1/2 to 5P3/2 can be used as a clock transition of Rb four levels for an atomic active optical clock. An active optical clock is a new conception of the atomic clock and has the potential to improve the stabil- ity of the best atomic clocks by about two orders of magnitude. Another application of the elec- trodeless discharge Rb vapor lamp is the Rb Faraday anomalous-dispersion optical filter （FADOF）（e.g., 776 nm] and 1529 nm spectroscopy）, in which the electrodeless discharge Rb vapor lamp is more feasible than the one using a laser pumped Rb vapor cell in some cases, since many excited states are populated enough for aimed FADOF transition. Although the rich spectra of Rb have many applications, so far no detailed investigations or applications have been achieved in 728.0nm transition. To the best of our knowledge, the Rb 728.0 nm spectral data are currently only from the fluorescence by Beacham arc spectrum of rubidium early in 1959.

关键词： Spectroscopy Electrodeless Discharge Rb Lamp

来源：评论

学校读者我要写书评

暂无评论

Untitled

引用

IEEE CIRCUITS AND SYSTEMS MAGAZINE 2014年第1期14卷 4-+页

作者： Tse, Chi K. School of Electronics and Information Engineering Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an China Department of Electrical and Computer Engineering University of Delaware Newark DE USA

The articles in this special issue focus on recent trends in circuits and systems engineering education, with particular emphasis on the principles of multiport communication theory; curriculum development; and biomet... 详细信息

关键词： Special issues and sections Circuits and systems Electrical engineering education Education courses Educational institutions Biometrics Communication theory

来源：评论

学校读者我要写书评

暂无评论

The study of a hierarchical hadoop architecture in multiple data centers environment

引用

Open Cybernetics and Systemics Journal 2015年第1期9卷 131-137页

作者： Shengtao, Sun Aizhi, Wu Xiaoyang, Liu School of Information Science and Engineering Yanshan University QinhuangdaoHebei066004 China College of Vehicles and Energy Yanshan University QinhuangdaoHebei066004 China Data Industry Research Institute Limited Company QinhuangdaoHebei066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province QinhuangdaoHebei066004 China

Hadoop is a reasonable tool for cloud computing in big data era and MapReduce paradigm may be a highly successful programming model for large-scale data-intensive computing application, but the conventional MapReduce model and Hadoop framework limit themselves to implement jobs within single cluster. Traditional single-cluster Hadoop may not suitable for situations when data and compute resources are widely distributed this paper focuses on the application of Hadoop across multiple data centers and clusters. A hierarchical distributed computing architecture of Hadoop is designed and the virtual Hadoop file system is proposed to provide global data view across multiple data centers. The job submitted by user can be decomposed automatically into several sub-jobs which are then allocated and executed on corresponding clusters by location-aware manner. The prototype based on this architecture shows encouraging results. © Shengtao et al.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

MRG-DBSCAN: An improved DBSCAN clustering method based on map reduce and grid

International Journal of Database Theory and Application

引用

International Journal of Database Theory and Application 2015年第2期8卷 119-128页

作者： Ma, Li Gu, Lei Li, Bo Qiao, Shouyi Wang, Jin Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing China School of Computer and Software Nanjing University of Information Science and Technology Nanjing China Key Laboratory of Meteorological Disaster Ministry of Education Nanjing University of Information Science and Technology Nanjing China CMA Research Centre for Strategic Development Beijing China

DBSCAN is a density-based clustering algorithm. This algorithm clusters data of high density. The traditional DBSCAN clustering algorithm in finding the core object, will use this object as the center core, extends outwards continuously. At this point, the core objects growing, unprocessed objects are retained in memory, which will occupy a lot of memory and I/O overhead, algorithm efficiency is not high. In order to ensure the high efficiency of DBSCAN clustering algorithm, and reduce its memory footprint. In this paper, the original DBSCAN algorithm was improved, and the G-DBSCAN algorithm is proposed. G-DBSCAN algorithm reduces the number of query object as a starting point. Put the data into the grid, with the center point of the data in the grid to replace all the grid points as the algorithm input. The query object will be drastically reduced, thus improving the efficiency of the algorithm, reduces the memory footprint. In order to make the G-DBSCAN algorithm can adapt to large data processing, we will parallelize the G-DBSCAN algorithm, and combining it with Map Reduce framework. The results prove that G-DBSCAN and MRG-DBSCAN algorithm are feasible and effective. © 2015 SERSC.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：