基于改进欧几里得聚类的激光雷达障碍物检测

针对传统的欧氏聚类算法无法同时对近处和远处的障碍物点云进行精准检测和分割,容易造成错检和漏检的情况,提出一种欧氏聚类算法的改进方法,可以根据点云与激光雷达之间的距离动态地选择阈值,从而快速且准确地完成聚类.实验表明:该方法能同时对近处和远处的障碍物点云进行快速且准确的聚类.     

改进的空间蚂蚁聚类算法

障碍约束下的空间聚类问题具有很强的实用价值,是空间数据挖掘中的一个重要研究课题.笔者讨论了带障碍约束的空间聚类问题,研究了一种基于蚂蚁算法的带障碍约束空间数据聚类分析方法,设计了一个带障碍约束的蚂蚁空间聚类算法.实验表明,该方法兼顾了局部收敛和全局收敛性能,考虑到了现实障碍物对聚类结果的影响,使聚类结果更具有实际意义.     

激光数据聚类和Morphin算法下的机器人避障研究

为了解决移动机器人在未知环境下的避障问题,提出了一种从障碍物检测、预测到避撞的避障方法。设定圆形窗口作为机器人有效扫描区域,利用激光传感器采集到的数据结合聚类、匹配和分类算法确定障碍物类型和动态障碍物运动信息,绘制窗口内的动态局部地图来预测动态障碍物与机器人的碰撞关系,结合Morphin算法实现有效的避障。仿真实验表明,在该算法下移动机器人能够有效地检测出障碍物,进行碰撞预测,并做出合理地避障措施。     

基于激光雷达点云密度特征的智能车障碍物检测与跟踪

现有的基于点云数据的车载三维激光雷达障碍物检测和跟踪存在实时性差、准确率不高以及场景内障碍物数目增多时难以有效关联等问题。针对这些不足,文章提出了结合区域生长与密度聚类的算法以及同时考虑了障碍物几何特征与点云密度特征的关联方法。基于栅格地图,运用最大、最小高度图法去除背景点云数据;在得到可靠障碍栅格地图后,搜索匹配8邻域栅格属性,结合自适应阈值的密度特征进行聚类,提高了障碍物检测准确率;考虑了障碍物的点云密度特征和高度特征,提高了障碍物关联的可靠性并运用卡尔曼滤波器对动态障碍物进行了跟踪。在自行搭建的智能车平台上进行的实车实验验证了该文算法的有效性。     

基于3D激光雷达的无人水面艇海上目标检测

无人水面艇(unmanned surface vehicle,USV)实现自主导航避障需要实时感知周围的环境信息,检测出威胁无人水面艇航行的障碍物,而3D激光雷达在无人系统障碍检测中起重要作用.提出了一种基于3D激光雷达的障碍检测算法,即将一个周期内的3D激光点云投影到2.5D栅格地图中,对障碍物进行聚类分割;对栅格中的原始点云数据进行特征提取,表示为椭圆障碍物.而多帧激光数据采用最近邻数据关联识别出其中的动态障碍物,并用卡尔曼滤波实时跟踪.基于电子海图的仿真激光数据验证了该方法在无人水面艇障碍检测中的有效性.     

一种改进的网络突发话题检测算法

引进文本相关度这一影响因子,提出了一种基于蚁群聚类算法的突发话题检测算法,该算法结合蚁群聚类算法的优势,综合考虑文本聚类和文本相关度的影响,得到对网络突发话题检测的最优聚类效果,并对近年来网络突发话题进行实验,达到了很好的聚类速度和聚类效果,验证了算法对突发话题检测的准确性和即时性.     

一种改进的聚类和孤立点检测算法

对基于距离的聚类及基于密度的孤立点检测方法进行了分析研究,提出了一种基于距离和密度的聚类和孤立点检测算法DDBCOD.该算法根据距离和密度阈值对数据进行聚类,并发现数据中的孤立点.实验表明,该算法能够识别任意形状的聚类,对高维数据有效,能够很好地识别出孤立点.     

基于距离和密度的聚类和孤立点检测算法

提出了一种基于距离和密度的聚类和孤立点检测算法.该算法根据距离和密度阈值对数据进行聚类,同时发现数据中的孤立点.实验结果表明,该算法能够识别任意形状的聚类,对高维数据有效,能够很好的识别出孤立点.     

基于扫描线种子填充的二值图像聚类算法

提出了一种基于扫描线种子填充的二值图像快速聚类算法 .该算法步骤为 :对二值图像进行扫描 ,如果检测到了目标点 ,则将该点作为新的聚类的种子 ,将该种子扩展到整个目标区域 ,形成一个包含目标区域的聚类 .该算法的特点为 :只需一次扫描即可动态生成所有聚类 ,聚类总数动态生成 ,每一时刻只有一个聚类被处理 ,可提前进行一些后续处理 ,算法描述简单 ,易于编程实现 .     

改进模糊聚类算法及其在入侵检测中的应用

针对将数据集隶属度概率和为1的条件用于模糊性事件时,影响聚类的正确率的情况,在不确定理论的基础上,研究了数据隶属度问题,提出一种新的基于隶属关系不确定的可能性改进模糊聚类算法.该算法在迭代过程中将聚类的可能隶属度与不确定性隶属度引入到目标函数中,使得样本中的元素不局限于仅属于一个聚类,与现有的聚类算法相比具有更好的聚类结果.通过在KDDCUP99数据集上实验,验证了该算法在入侵检测中的检测率为95.8%, 分别高于K-均值算法的检测率(60.4%)和FCM算法的检测率(64.6%).     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.     

Tracking data management using topology of moving object database system for moving object constrained trajectory in LBS application

Advances in wireless technologies and positioning technologies and spread of wireless devices, an interest in LBS (Location Based Service) is arising. To provide location based service, tracking data should have been stored in moving object database management system (called MODBMS) with proper policies and managed efficiently. So the methods which acquire the location information at regular time intervals then, store and manage have been studied. In this paper, we suggest tracking data management techniques using topology that is corresponding to the moving path of moving object. In our techniques, we update the MODBMS when moving object arrived at a street intersection or a curved road which is represented as the node in topology and predict the location at past and future with attribute of topology and linear function. In this technique, location data that are corresponding to the node in topology are stored, thus reduce the number of update and amount of data. Also in case predicting the location,because topology are used as well as existing location information, accuracy for prediction is increased than applying linear function or spline function.