Polar-Cartesian Hybrid Transforms: A novel 2D range scan registration algorithm

Registration of range scans is commonly required in many localization and mapping algorithms. In this paper, we introduce a novel approach called Polar-Cartesian Hybrid Transforms for pair-wise registration of range scans. The proposed algorithm iteratively establishes correspondences by searching the points with closest polar angles in the polar coordinate frame. An angular look-up table is constructed based on the properties of the laser range finder to accelerate the searching procedure. In order to speed up the convergence, we compute the difference of polar range of every matched point pair to select the most contributing correspondences. After the correspondences are determined, the transformation is computed in Cartesian coordinate frame using a point-to-line metric. Combining the advantages of the polar and Cartesian coordinate frames, both robustness and efficiency are greatly improved compared with an up-to-date ICP algorithm.     

New insights on survivability in multi-domain optical networks

With the development of intelligent optical networks and the general multi-protocol label switching (GMPLS) technique, the seamless convergence between IP network and optical network is no longer be a dream but a practical reality. Similar to the Internet, current optical networks have been divided into multiple domains each of which has its own network provider and management policy. Therefore, the development of multi-domain optical networks will be the trend of new-generation intelligent optical networks, and GMPLS-based survivability for multi-domain optical networks will become a hot topic of research in the future. This paper provides a comprehensive review of the existing survivable schemes in multi-domain optical networks and analyzes the shortcomings of current research. Based on previous studies, we present possible challenges and propose new ideas to design efficient survivable schemes to guide the future work of researchers in multi-domain optical networks.     

基于ASP.NET的水稻分子育种信息平台管理系统

为实现水稻生物学数据的共享、交流和利用,基于ASP.NET,结合国内外水稻分子育种研究的现状和需求,构建了水稻分子育种信息平台.系统平台设计了基因库、QTL库和Ontology等多个子库和模块,并针对生物学数据的特点,采用B/S架构,运用存储过程和分页技术等多重手段,实施了客户端和服务器端双重安全屏障.对系统的实现技术、实现方案和优化设计等进行了详细的讨论和阐述.     

对新简化差别矩阵的研究

通过反例证明当决策表含不一致对象时,无法通过简化差别矩阵得到正确的核和约简.产生该问题的原因在于简化差别矩阵和简化决策表对不一致对象的处理均存在欠缺.提出新简化差别矩阵(NSDM)定义,通过利用新简化决策表把一致对象和不一致对象分开存放的特点修正了这两处缺陷.NSDM能够处理含多种不一致对象的决策表,并且能够得到正确的核和约简.利用前人的基于差别矩阵的求核和求约简算法分别以NSDM和简化差别矩阵为基础求核和约简,然后再利用核和约简的定义求核和约简,通过比较证明以NSDM为基础得到的核和约简是正确的.这说明NSDM可以有效地处理不一致对象并且通过NSDM能够得到正确的核和约简.这个实验同时验证了原有的以差别矩阵为基础的求核和求约简的算法不加改动就可以在新差别矩阵上使用.     

Point cloud completion via structured feature maps using a feedback network

Computational Visual Media - In this paper, we tackle the challenging problem of point cloud completion from the perspective of feature learning. Our key observation is that to recover the...     

Evaluation Model of Click Rate of Electronic Commerce Advertising Based on Fuzzy Genetic Algorithm

Mobile Networks and Applications - In order to improve the ability of quantitative evaluation of e-commerce advertising click rate, a model of e-commerce advertising click rate evaluation based on...     

Service placement strategy for joint network selection and resource scheduling in edge computing

The Journal of Supercomputing - In the edge computing, service placement refers to the process of installing service platforms, databases, and configuration files corresponding to computing tasks...     

Syntax–Aware graph convolutional network for the recognition of chinese implicit inter-sentence relations

The Journal of Supercomputing - In the literature, most previous studies on English implicit inter-sentence relation recognition only focused on semantic interactions, which could not exploit the...     

Data-driven physical law learning model for chaotic robot dynamics prediction

Applied Intelligence - A robot control system is a multivariable, nonlinear automatic control system, as well as a dynamic coupling system. To address the difficult problem of data prediction under...