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

2013 International Conference on Communication technology, ICCT 2013

作者： Ding, Jiaman Du, Yi Wang, Qingxin Jiang, Ying Yunnan Provincial Key Laboratory of Computer Technology Application Kunming University of Science and Technology Kunming China City College Kunming University of Science and Technology Kunming China

ISBN: (纸本)9781845648633

In order to solve the efficiency problem about the data-intensive query join in cloud computing environment, a Shrink-Semis Join for Cloud Computing (SSJFCC) method for data-intensive was proposed. This paper firstly analyzed and compared the bottlenecks of existing query join algorithm in the cloud computing environment. Secondly, aiming to shrink semi-results data from join process, five algorithms of SSJFCC method were designed. Finally, the improvement method had been implemented based on Hadoop framework. Experiments show that this method significantly reduced the network transmission data quantity and join computing time-consuming, and improved the data-intensive query efficiency. © 2014 WIT Press.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Research in video detection of lane curve and its application in speed alert system

引用

Research Journal of Applied Sciences, Engineering and technology 2014年第5期7卷 957-962页

作者： Song, Maliang Liu, Xiaoyan Faculty of Information Engineering and Automation Kunming University of Science and Technology Yunnan Province 650500 China Yunnan Provincial Key Laboratory of Computer Application Technology Yunnan Province 650500 China

That vehicles travel on a curve with excessive speed tends to skid or roll over. This study presents research in video recognition technology of lane and its application in traffic early safety alert system, which improves traffic safety. In our study, we use a monocular camera to acquire the image of the road ahead. Techniques such as gray-scale transformation, filtering, edge detection and curve fitting are used for the recognition of the lane line and curve fitting. Then radius of curvature of the road ahead will be extracted and then the maximum safe speed, which is to be compared with the speed of the vehicle in safety alert system. Experiments show that this method can accurately calculate the radius of the curve ahead and timely give alert message when the vehicle's speed exceeds safe speed. © Maxwell Scientific Organization, 2014.

关键词： computer image processing Coordinate transform Monocular vision Speed alert

来源：评论

学校读者我要写书评

暂无评论

An improved biclustering algorithm for gene expression data

引用

Open Cybernetics and Systemics Journal 2014年第1期8卷 1141-1144页

作者： Jin, Sheng-Hua Hua, Li School of Computer Engineering Huaiyin Institute of Technology HuaianJiangsu223003 China Huaian key Laboratory of the Study and Application of Internet of Things HuaianJiangsu223003 China Jiangsu “Internet of Things” Mobile Internet Technology Engineering laboratory HuaianJiangsu223003 China

Cheng-Church (CC) biclustering algorithm is the popular algorithm for the gene expression data mining at present. Only find one biclustering can be found at one time and the biclustering that overlap each other can hardly be found when using this algorithm. This article puts forward a modified algorithm for the gene expression data mining that uses the middle biclustering result to conduct the randomization process, digging up more eligible biclustering data. It also raised a parallel computing method that uses the multi-core processor or cluster environment to improve efficiency. It is proved by experimental verification that the modified algorithm enhances the precision and efficiency of the gene expression data mining to a certain degree. © Jin and Hua;Licensee Bentham Open.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A parallel genetic algorithm based on opencl in resolving 0/1 knapsack problems 2

A parallel genetic algorithm based on opencl in resolving 0/...

引用

2nd International Conference on Materials, Transportation and Environmental Engineering, CMTEE 2014

作者： Chang, Long Shi, Lin Information Engineering and Automation School Kunming University of Science and Technology China Yunnan Provincical Computer Application Key Laboratory Kunming University of Science and Technology China

ISBN: (纸本)9783038352488

This paper mainly focused on 0/1 knapsack problems based on the genetic algorithm (GA). According to characteristics of the individual independence in GA, a parallel segmentation method was presented using the OpenCL technology in resolving the 0/1 knapsack problems. Moreover, the local memory was partially optimized in the statistical operation of GA. Experiment results in comparing serial and parallel algorithm implementations showed that the parallel algorithm implementation was operative and the execution time of the parallel algorithm implementation increased linearly according to the increment of problem scale. By comparing the execution time of implementations on CPU and GPU under various individuals and iterations conditions, the effects on CPU and GPU of this method were also analyzed. © (2014) Trans Tech Publications, Switzerland.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Behaviour analysis using mutual inuences

引用

Journal of Computational Information Systems 2014年第21期10卷 9143-9151页

作者： Yu, Mei Du, Yu Hou, Dejun Zhou, Jing Lei, Ting School of Computer Science and Technology Tianjin University Tianjin China Tianjin Key Laboratory of Cognitive Computing and Application Tianjin University Tianjin China Office of State-owned Assets and Equipment Management Tianjin University Tianjin China

Social network analysis has received enormous attention in recent years, owing to the success of online social networking sites. This trend leads to the generation of a wealth of social network data. Therefore, the potential research impact of these techniques is still largely unexplored. In this article we address the problem of behavior analysis of huge amounts of data produced in social networks. Such a problem arises naturally in data analysis industry where one aims to understand users' tastes with multiple traces from his history of surfing the net as correctly as possible. In each phase we present a brief overview of the problem, describe state-of-the art approaches, transform the model to deal with massive data examples, and map each of the topics to a behavior analysis framework. Furthermore, two probability analysis methods are compared to handle the situations what are really the users' interest and to what extent that users' privacy via online social network will be disclosed. We then investigate into applications of our algorithm to community user tastes analysis. In addition, experimental results on challenging real-world datasets show that the risk assessment capability of our proposed algorithm is effective. The main contribution of the article is to propose a state-of-the-art conversion of current techniques while providing a critical perspective on behavior analysis applications of social network analysis and data mining.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Finding the cost-optimal path with time constraint over time-dependent graphs 40th

Finding the cost-optimal path with time constraint over time...

引用

Proceedings of the 40th International Conference on Very Large Data Bases, VLDB 2014

作者： Yang, Yajun Gao, Hong Yu, Jeffrey Xu Li, Jianzhong School of Computer Science and Technology Tianjin University China Tianjin Key Laboratory of Cognitive Computing and Application Tianjin China School of Computer Science and Technology Harbin Institute of Technology China Chinese University of Hong Kong Hong Kong

Shortest path query is an important problem and has been well studied in static graphs. However, in practice, the costs of edges in graphs always change over time. We call such graphs as timedependent graphs. In this paper, we study how to find a costoptimal path with time constraint in time-dependent graphs. Most existing works regarding the Time-Dependent Shortest Path (TDSP) problem focus on finding a shortest path with the minimum travel time. All these works are based on the following fact: the earliest arrival time at a vertex v can be derived from the earliest arrival time at v's neighbors. Unfortunately, this fact does not hold for our problem. In this paper, we propose a novel algorithm to compute a cost-optimal path with time constraint in time-dependent graphs. We show that the time and space complexities of our algorithm are O(κn log n + mκ) and O((n + m)κ) respectively. We confirm the effectiveness and efficiency of our algorithm through conducting experiments on real datasets with synthetic cost. © 2014 VLDB Endowment.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Encoding Spatial Context for Large-Scale Partial-Duplicate Web Image Retrieval

引用

Journal of computer Science & technology 2014年第5期29卷 837-848页

作者：周文罡李厚强卢亦娟田奇 Chinese Academy of Sciences Key Laboratory of Technology in Geo-Spatial Information Processing and Application System University of Science and Technology of China Department of Electronic Engineering and Information Science University of Science and Technology of China Department of Computer Science Texas State UniversitySan Marcos TX 78666 U.S.A. MemberACMIEEE Department of Computer Science University of Texas at San AntonioSan Antonio TX 78249 U.S.A. Senior MemberIEEE

Many recent state-of-the-art image retrieval approaches are based on Bag-of-Visual-Words model and represent an image with a set of visual words by quantizing local SIFT（scale invariant feature transform） features. Feature quantization reduces the discriminative power of local features and unavoidably causes many false local matches between images, which degrades the retrieval accuracy. To filter those false matches, geometric context among visual words has been popularly explored for the verification of geometric consistency. However, existing studies with global or local geometric verification are either computationally expensive or achieve limited accuracy. To address this issue, in this paper, we focus on partialduplicate Web image retrieval, and propose a scheme to encode the spatial context for visual matching verification. An efficient affine enhancement scheme is proposed to refine the verification results. Experiments on partial-duplicate Web image search, using a database of one million images, demonstrate the effectiveness and efficiency of the proposed *** on a 10-million image database further reveals the scalability of our approach.

关键词： large-scale image retrieval spatial context coding spatial verification affine estimation

来源：评论

学校读者我要写书评

暂无评论

Sub-pixel change detection for urban land-cover analysis via multi-temporal remote sensing images

引用

Geo-Spatial Information Science 2014年第1期17卷 26-38页

作者： Peijun DU Sicong LIU Pei LIU Kun TAN Liang CHENG Key Laboratory for Satellite Mapping Technology and Application of National Administration of Surveying Mapping and GeoinformationNanjing UniversityNanjing CityJiangsu ProvinceP.R.China Department of Information Engineering and Computer Science University of TrentoTrentoItaly Jiangsu Provincial Key Laboratory for Resources and Environment Information Engineering China University of Mining and TechnologyXuzhouJiangsu ProvinceP.R.China

Conventional change detection approaches are mainly based on per-pixel processing,which ignore the sub-pixel spectral variation resulted from spectral *** for medium-resolution remote sensing images used in urban landcover change monitoring,land use/cover components within a single pixel are usually complicated and heterogeneous due to the limitation of the spatial ***,traditional hard detection methods based on pure pixel assumption may lead to a high level of omission and commission errors inevitably,degrading the overall accuracy of change *** order to address this issue and find a possible way to exploit the spectral variation in a sub-pixel level,a novel change detection scheme is designed based on the spectral mixture analysis and decision-level *** spectral mixture model is selected for spectral unmixing,and change detection is implemented in a sub-pixel level by investigating the inner-pixel subtle changes and combining multiple composition *** proposed method is tested on multi-temporal Landsat Thematic Mapper and China–Brazil Earth Resources Satellite remote sensing images for the land-cover change detection over urban *** effectiveness of the proposed approach is confirmed in terms of several accuracy indices in contrast with two pixel-based change detection methods(*** vector analysis and principal component analysis-based method).In particular,the proposed sub-pixel change detection approach not only provides the binary change information,but also obtains the characterization about change direction and intensity,which greatly extends the semantic meaning of the detected change targets.

关键词： change detection sub-pixel level processing multi-temporal images spectral mixture model back propagation neural network remote sensing

来源：评论

学校读者我要写书评

暂无评论

Analysis of correlation registration algorithms in the observation of solar magnetic field

引用

2012 International Conference on Electrical and Electronics Engineering, ICEE 2012

作者： Chen, Jie Ji, Kaifan Deng, Hui Feng, Song Computer Technology Application Key Lab of Yunnan Province Kunming University of Science and Technology Cheng gong 650500 Kunming China Key Laboratory of Solar Activity National Astronomical Observatories Chinese Academy of Sciences Beijing 10001 China

ISBN: (纸本)9781461449805

This study compared and analyzed the image registration algorithms of phase correlation and cross-correlation for obtaining high SNR images. By processing both the simulated and measured images, five statistics to evaluate the results of the processing were chosen, which are the mean and variance of the difference images, the maximum correlation value of registration images, entropy of accumulated images, and energy of the magnetic images. It was concluded that the phase correlation algorithm was more sensitive to noise than cross-correlation, and the cross-correlation algorithm was more suitable for the real-time processing of solar magnetic field images. © 2014 Springer Science+Business Media New York.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Large-scale simulation of complex water scenes based on spherical projected grid

引用

Ruan Jian Xue Bao/Journal of Software 2014年 25卷 247-257页

作者： Xiong, Yuan Liu, Shi-Guang School of Computer Science and Technology Tianjin University Tianjin300072 China Tianjin Key Laboratory of Cognitive Computing and Application Tianjin300072 China

Current simulation methods for large-scale complex water scenes suffer from various problems such as low efficiency, and complicated collision detection. To remedy these problems, this paper presents a novel method for ocean-scale complex simulation based on spherical mapping projected grid. First, a novel spherical projected grid method is proposed for animating large scale water waves. Compared with conventional projected grid method, the new method does not need reconstructing projectors intersecting with the sphere, and thereby can achieve higher rendering efficiency which is also suitable for graphics hardware acceleration. Then, a new method is designed for simulating interactions including water-rigid body interaction and rigid body-terrain interaction. Additionally, a general bubble and coast line rendering framework is provided. Experiments demonstrate that the proposed method can realize realistic rendering results with high rendering rates (FPS>60), and can be applied in real time scenarios such as computer games and virtual reality. ©2014 ISCAS.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：