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

Qualitative Spatial Reasoning with Oriented Point Relation in 3D Space

Chinese Journal of Electronics 2019年第2期28卷 325-330页

作者： WANG Shengsheng DONG Ruyi SONG Wenzhuo WANG Chuangfeng College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computing and Knowledge Engineering of Ministry of Education Jilin Vocational College of Industry and Technology

Among qualitative direction relation models, Oriented point relation algebra（OPRAm） is a remarkable model for robot navigation with uncertain direction information. It has great advantages in providing powerful expressions with very limited information compared with other point-based spatial relation *** original OPRAm is defined in 2D space, and its model and reasoning algorithm are found not applicable in 3D space. We proposed a novel direction relation model named OPRA3Dmto extend the original OPRAm to 3D space,and presented a new reasoning algorithm on Oriented point relation algebra in three dimension（OPRA3Dm）. A further study was carried out for composition reasoning on OPRA3Dm. The proposed reasoning algorithm will deduce new information which cannot be directly detected by hardware. The experiment showed the algorithm had some practical significance, it can be applied to the Unmanned aerial vehicle（UAV） navigation and similar scenarios.

关键词： Qualitative spatial reasoning Oriented point relation algebra in three dimension(OPRA3Dm) Composition reasoning Unmanned aerial vehicle navigation

来源：评论

学校读者我要写书评

暂无评论

A Novel Iterative Velocity Control Algorithm and Its FPGA Implementation Based on Trigonometric Function

引用

Chinese Journal of Electronics 2019年第2期28卷 237-245页

作者： WEN Quangang LIANG Yanchun Adriano Tavares Ricardo Teixeira WU Chunguo Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University Department of Industrial Electronics University of Minho Campus de Azurm

The servo motor’s flexible acceleration/deceleration(acc/dec) control is an emerging research topic in the automation field. A velocity control algorithm based on trigonometric function is proposed in this *** required parameters, it transforms trigonometric calculations into elementary mathematical operations and calculates the velocity controlling values iteratively, which could avoid trigonometric calculation and reduce the computation time. Experimental results show that the proposed algorithm is suitable for implementation on field programmable gate arrays and achieves a flexible controlling, enhancing both the equipment’s stability and reliability. It is promising to significantly improve the high-speed computerized numerical control equipment’s controlling accuracy, without a huge hardware resource consumption.

关键词： Acceleration Velocity control Algorithm design and analysis Field programmable gate arrays Servomotors

来源：评论

学校读者我要写书评

暂无评论

A Graph Attribute Aggregation Method based on Feature engineering

引用

Journal of The Institution of Engineers (India): Series B 2022年第3期103卷 711-719页

作者： Wang, Hao Dong, Li-Yan Ma, Xin-Tao Sun, Ming-Hui College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

In the fields of social network analysis and knowledge graph, many semi-supervised learning algorithms based on graph convolutional neural network (GCN) have been widely used. Most of these algorithms usually improve the structure of the neural network and the sampling method of each layer of the neural network. However, they don’t pay much attention to the data pre-processing of the algorithm. In the analysis of the input data, the words of different quality in these original data are unevenly distributed. This may obscure some useful data and highlight some irrelevant data. In order to verify the correctness of this hypothesis, the paper proposes a feature matrix compression algorithm (FMC algorithm) for data pre-processing of GCN-based algorithms. The algorithm analyzes and arranges the word columns of the input matrix (the feature of graph) according to the frequency of the word, then merges those words in which the word frequency is smaller, so as to emphasize the role of these words in the graph and optimize the data scale. The present work uses four mainstream datasets in the field and several representative and different algorithms to complete the experiment. The experimental results show that the FMC algorithm achieves better performance. © 2021, The Institution of Engineers (India).

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

A Simplified Rational Representation for Positive-Dimensional Polynomial Systems and SHEPWM Equations Solving

引用

Journal of Systems Science & Complexity 2017年第6期30卷 1470-1482页

作者： SHANG Baoxin ZHANG Shugong TAN Chang XIA Peng School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering (Ministry of Education) Jilin University College of Science Northeast Electric Power University College of Science Northeast Forestry University School of Mathematics Liaoning University

The paper is concerned with the improvement of the rational representation theory for solving positive-dimensional polynomial systems. The authors simplify the expression of rational representation set proposed by Tan and Zhang(2010), obtain the simplified rational representation with less rational representation sets, and hence reduce the complexity for representing the variety of a positive-dimensional ideal. As an application, the authors compute a "nearly" parametric solution for the SHEPWM problem with a fixed number of switching angles.

关键词： Positive-dimensional polynomial system solving rational univariate representation SHEPWM simplified rational representation

来源：评论

学校读者我要写书评

暂无评论

Hyponymy Graph Model for Word Semantic Similarity Measurement

引用

Chinese Journal of Electronics 2015年第1期24卷 96-101页

作者： WANG Junhua ZUO Wanli PENG Tao College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering attached to the Ministry of Education

Measuring word semantic similarity is a generic problem with a broad range of applications such as ontology mapping, computational linguistics and artificial intelligence. Previous approaches to computing word semantic similarity did not consider concept occurrence frequency and word’s sense number. This paper introduced Hyponymy graph, and based on which proposed a novel word semantic similarity model. For two words to be compared, we first retrieve their related concepts; then produce lowest common ancestor matrix and distance matrix between concepts; finally calculate distance-based similarity and information-based similarity, which are integrated to get final semantic similarity. The main contribution of our method is that both concept occurrence frequency and word’s sense number are taken into account. This similarity measurement more closely fits with human rating and effectively simulates human thinking process. Our experimental results on benchmark dataset M&C and R&G with Word Net2.1 as platform demonstrate roughly 0.9%–1.2%improvements over existing best approaches.

关键词： Word semantic similarity Concept semantic similarity Semantic similarity Hyponymy graph model Word Net.

来源：评论

学校读者我要写书评

暂无评论

Dilated Convolutional Pixels Affinity Network for Weakly Supervised Semantic Segmentation

引用

Chinese Journal of Electronics 2021年第6期30卷 1120-1130页

作者： ZHANG Zhe WANG Bilin YU Zhezhou LI Zhiyuan College of Computer Science and Technology Jilin University Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry

This paper studies semantic segmentation primarily under image-level weak-supervision. Most stateof-the-art technologies have recently used deep classification networks to create small and sparse discriminatory seed regions of each interest target as pseudo-labels for training segmentation networks, which achieve inferior performance compared with the fully supervised *** propose a Dilated convolutional pixels affinity network(DCPAN) to localize and expand the seed regions of objects to bridge this gap. Although introduced dilated convolutional units enable capture of additional location information of objects, it falsely highlighted true negative regions as dilated rate enlarge. To address this problem,we properly integrate dilated convolutional units with different dilated rates and self-attention mechanisms to obtain pixel affinity measure matrix for promoting classification network to generate high-quality object seed regions as pseudo-labels; thus, the performance of the segmentation network is boosted. Furthermore,although our approach seems simple, our method obtains a competitive performance, and experiments show that the performance of DCPAN outperforms other state-ofart approaches in weakly-supervised settings, which only use image-level labels on the Pascal VOC 2012 dataset.

关键词： weakly supervised semantic segmentation pseudolabels deep classification networks high-quality object seed regions pattern classification image segmentation weakly-supervised settings dilated convolutional pixels affinity network image-level weak-supervision image classification DCPAN self-attention mechanism object recognition feature extraction object detection sparse discriminatory seed regions pixel affinity measure matrix Pascal VOC 2012 dataset

来源：评论

学校读者我要写书评

暂无评论

Computing minimal diagnosis with binary decision diagrams algorithm

Computing minimal diagnosis with binary decision diagrams al...

引用

6th International Conference on Fuzzy Systems and knowledge Discovery, FSKD 2009

作者： Wang, Kun Li, Zhan-Shan Ai, Yang Zhang, Yong-Gang Key Laboratory of Symbolic Computation Knowledge Engineering for Ministry of Education Jilin University Jilin Changchun China

ISBN: (纸本)9780769537351

In this paper we propose an algorithm of computing minimal diagnosis based on BDD (Binary Decision Diagram). First we give the concept of disjunction equations, and map the collection of conflict sets into disjunction equations, then we compile the system into a BDD, further we compute the minimal hitting sets by solving the BDD and minimizing hitting sets. The reliability and completeness of the algorithm are proved. Variable ordering and construct controlling of BDD are used to further reduce the size of final BDD and the number of non-minimal hitting sets to be generated. The efficiency of computing minimal hitting sets is highly improved. Experimental results show that the algorithm isn't restricted by the structure of system and conflict sets, compared with three algorithms in the references, it can generate all the minimal hitting sets, and it works well in random circumstances. © 2009 IEEE.

关键词： Binary decision diagrams

来源：评论

学校读者我要写书评

暂无评论

Modulating a Local Shape Descriptor through Biologically Inspired Color Feature

引用

Journal of Bionic engineering 2014年第2期11卷 311-321页

作者： Hongwei Zhao Baoyu Zhou Pingping Liu Tianjiao Zhao School of Computer Science and Technology Jilin University Changchun 130012 P. R. China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 P. R. China

This paper presents a biologically inspired local image descriptor that combines color and shape features. Compared with previous descriptors, red-cyan cells associated with L, M, and S cones （L for long, M for medium, and S for short） are used to indicate one of the opponent color channels. Stepping forward from state-of-the-art color feature extraction, we exploit a new approach to compute the color orientation and magnitudes of three opponent color channels, namely, red-green, blue-yellow, and red-cyan, in two-dimensional space. Color orientation is calculated in histograms with magnitude weighting. We linearly concatenate the four-color-opponent-channel histogram and scale-invariant-feamre-transform histogram in the final step. We apply our biologically inspired descriptor to describe the local image feature. Quantitative comparisons with state-of-the-art descriptors demonstrate the significant advantages of maintaining invariance to photometric and geometric changes in image matching, particularly in cases, such as illumination variation and image blurring, where more color contrast information is observed.

关键词： local image descriptor color opponent color scale-invariant feature transform image matching

来源：评论

学校读者我要写书评

暂无评论

Bionic Mosaic Method of Panoramic Image Based on Compound Eye of Fly

引用

Journal of Bionic engineering 2011年第4期8卷 440-448页

作者： Haipeng Chen Xuanjing Shen Xiaofei Li Yushan Jin College of Computer Science and Technology Jilin University Changchun 130012 P. R. China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 P. R. China

To satisfy the requirements of real-time and high quality mosaics, a bionic compound eye visual system was designed by simulating the visual mechanism of a fly compound eye. Several CCD cameras were used in this system to imitate the small eyes of a compound eye. Based on the optical analysis of this system, a direct panoramic image mosaic algorithm was proposed. Several sub-images were collected by the bionic compound eye visual system, and then the system obtained the overlapping proportions of these sub-images and cut the overlap sections of the neighboring images. Thus, a panoramic image with a large field of view was directly mosaicked, which expanded the field and guaranteed the high resolution. The experimental results show that the time consumed by the direct mosaic algorithm is only 2.2% of that by the traditional image mosaic algorithm while guaranteeing mosaic quality. Furthermore, the proposed method effectively solved the problem of misalignment of the mosaic image and eliminated mosaic cracks as a result of the illumination factor and other factors. This method has better real-time properties compared to other methods.

关键词： bionic compound eye panoramic image image mosaic direct mosaic algorithm

来源：评论

学校读者我要写书评

暂无评论

Painlevé Property and Integrability of Polynomial Dynamical Systems

引用

Communications in Mathematical Research 2014年第4期30卷 358-368页

作者： Li Wen-lei Shi Shao-yun School of Mathematics Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University

The main purpose of this paper is to investigate the connection between the Painlev′e property and the integrability of polynomial dynamical systems. We show that if a polynomial dynamical system has Painlev′e property, then it admits certain class of first integrals. We also present some relationships between the Painlev′e property and the structure of the differential Galois group of the corresponding variational equations along some complex integral curve.

关键词： Painlev′e property integrability differential Galois group

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：