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

Solving constrained traveling salesman problems by genetic algorithms

自然科学进展(英文版) 2004年第7期14卷 631-637页

作者： WU Chunguo LIANG Yanchun LEE Heowpueh LU Chun LIN Wuzhong College of Computer Science and Technology Jilin University Key Laboratory for Symbol Computation and Knowledge Engineering Ministry of Education of China Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore Institute of High Performance Computing Singapore 117528 Singapore

Three kinds of constrained traveling salesman problems (TSP) arising from application problems, namely the open route TSP, the end-fixed TSP, and the path-constrained TSP, are proposed. The corresponding approaches based on modified genetic algorithms (GA) for solving these constrained TSPs are presented. Numerical experiments demonstrate that the algorithm for the open route TSP shows its advantages when the open route is required, the algorithm for the end-fixed TSP can deal with route optimization with constraint of fixed ends effectively, and the algorithm for the path-constraint could benefit the traffic problems where some cities cannot be visited from each other.

关键词： constrained traveling salesman problem genetic algorithm Hamiltonian path open route fixed end

来源：评论

学校读者我要写书评

暂无评论

Crossed-Time Delay Neural Network for Speaker Recognition 1

引用

27th International Conference on MultiMedia Modeling, MMM 2021

作者： Chen, Liang Liang, Yanchun Shi, Xiaoshu Zhou, You Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education School of Computer Zhuhai College of Jilin University Zhuhai519041 China

ISBN: (数字)9783030678326

ISBN: (纸本)9783030678319

Time Delay Neural Network (TDNN) is a well-performing structure for deep neural network-based speaker recognition systems. In this paper we introduce a novel structure, named Crossed-Time Delay Neural Network (CTDNN) to enhance the performance of current TDNN for speaker recognition. Inspired by the multi-filters setting of convolution layers from convolution neural networks, we set multiple time delay units with different context size at the bottom layer and construct a multilayer parallel network. The proposed CTDNN gives significant improvements over original TDNN on both speaker verification and identification tasks. It outperforms in VoxCeleb1 dataset in verification experiment with a 2.6% absolute Equal Error Rate improvement. In few shots condition, CTDNN reaches 90.4% identification accuracy, which doubles the identification accuracy of original TDNN. We also compare the proposed CTDNN with another new variant of TDNN, Factorized-TDNN, which shows that our model has a 36% absolute identification accuracy improvement under few shots condition. Moreover, the proposed CTDNN can handle training with a larger batch more efficiently and hence, utilize calculation resources economically. © 2021, Springer Nature Switzerland AG.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Image registration based on pseudo-polar FFT and analytical fourier-mellin transform

Image registration based on pseudo-polar FFT and analytical ...

引用

International Conference on Intelligent Computing, ICIC 2005

作者： Guo, Xiaoxin Xu, Zhiwen Lu, Yinan Liu, Zhanhui Pang, Yunjie College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Qianjin Street 2699 Changchun 130012 China

ISBN: (纸本)9783540282266

This paper proposes a novel registration algorithm based on Pseudo-Polar Fast Fourier Transform (FFT) and Analytical Fourier-Mellin Transform (AFMT) for the alignment of images differing in translation, rotation angle, and uniform scale factor. The proposed algorithm employs the AFMT of the Fourier magnitude to determine all the geometric transformation parameters with its property of the invariance to translation and rotation. Besides, the proposed algorithm adopt a fast high accuracy conversion from Cartesian to polar coordinates based on the pseudo-polar FFT and the conversion from the pseudo-polar to the polar grid, which involves only ID interpolations, and obtain a more significant improvement in accuracy than the conventional method using cross-correlation. Experiments show that the algorithm is accurate and robust regardless of white noise. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

An efficient method for very large scale out-of-core terrain visualization

An efficient method for very large scale out-of-core terrain...

引用

16th International Conference on Artificial Reality and Telexistence - Workshops, ICAT 2006

作者： Zhang, Huijie Sun, Jigui Yu, Haihong Qi, Changsong College of Computer Science and Technology Jilin University College of Computer Science Northeast Normal University Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education

ISBN: (纸本)076952754X

Large scale terrain visualization with high-resolution has an increasing demand in many research fields. To realize the efficient rendering of terrain, this paper presents an out-of-core terrain visualization method based on multi-resolution storage techniques. In external memory, the terrain data set is subdivided from top to bottom to build a multi-resolution hierarchical structure based on a quad-tree. The hierarchical structure can decimate the elevation data that must be loaded into internal memory. Thus it can improve the efficiency of I/O access greatly. Moreover, in order to implement rapid data retrieval of the real time terrain flyover, an efficient indexing algorithm is proposed, in which those nodes in the hierarchical structure will be divided into several clusters in terms of the similarities of static error and the closed space constraint. In addition, a method for crack-free is also proposed here. The comprehensive experiment conducted on the GTOP30 data set shows that this approach outperforms the Block and the Hierarchy algorithms in the both ways of efficiency and simplification ratio. © 2006 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

A hybrid algorithm for combining forecasting based on AFTER-PSO

A hybrid algorithm for combining forecasting based on AFTER-...

引用

8th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2004: Trends in Artificial Intelligence

作者： Feng, Xiaoyue Liang, Yanchun Sun, Yanfeng Lee, Heow Pueh Zhou, Chunguang Wang, Yan Key Laboratory of Symbol Computation and Knowledge Engineering Juin University Ministry of Education Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore

ISBN: (纸本)3540228179

A novel hybrid algorithm based on the AFTER (Aggregated forecast through exponential re-weighting) and the modified particle swarm optimization (PSO) is proposed. The combining weights in the hybrid algorithm are trained by the modified PSO. The linear constraints are added in the PSO to ensure that the sum of the combining weights is equal to one. Simulated results on the prediction of the stocks data show the effectiveness of the hybrid algorithm. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Community discovery algorithm and its technical improvement based on link structure–taking web community algorithm as an example

Community discovery algorithm and its technical improvement ...

引用

International Conference on Applications and Techniques in Cyber Intelligence, ATCI 2020

作者： Gao, Rui Yang, Wenzhe Shi, Xiaohu Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University 2699 Qianjin Street Changchun130012 China

ISBN: (纸本)9783030539795

Link analysis is an important way to discover potential web communities. This paper analyzes the characteristics of the Web link structure, and studies the traditional maximum flow algorithm and the maximum flow algorithm based on HITS algorithm for edge capacity allocation. The traditional maximum flow problem, but there are still shortcomings. Based on the analysis of existing link similarity definitions, this paper proposes a new definition of link similarity and topic dissimilarity to better describe the relationship between linked pages, and to measure based on link similarity and topic dissimilarity. The similarity of the pages gives a more reasonable and efficient maximum flow-side capacity allocation scheme. The community discovery of 6 topics shows that the maximum flow algorithm proposed in this paper using the link similarity and topic dissimilarity model to allocate edge capacity can better solve the problems of existing algorithms and significantly improve the quality of the Web community. This paper proposes new methods and ideas for page similarity measurement, and provides new strategies for improving the Web community discovery algorithm based on link analysis. © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Hilbert-huang transform-based local regions descriptors

Hilbert-huang transform-based local regions descriptors

引用

2007 18th British Machine Vision Conference, BMVC 2007

作者： Han, Dongfeng Li, Wenhui Guo, Wu Li, Zongcheng Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China School of Engineering Technology Shandong University of Technology Zibo China

ISBN: (纸本)1901725340

This paper presents a new interest local regions descriptors method based on Hilbert-Huang Transform. The neighborhood of the interest local region is decomposed adaptively into oscillatory components called intrinsic mode functions (IMFs). Then the Hilbert transform is applied to each component and get the phase and amplitude information. The proposed descriptors samples the phase angles information and amalgamates them into 10 overlap squares with 8-bin orientation histograms. The experiments show that the proposed descriptors are better than SIFT and other standard descriptors. Essentially, the Hilbert-Huang Transform based descriptors can belong to the class of phase-based descriptors. So it can provides a better way to overcome the illumination changes. Additionally, the Hilbert-Huang transform is a new tool for analyzing signals and the proposed descriptors is a new attempt to the Hilbert-Huang transform.

关键词： Hilbert-Huang transform

来源：评论

学校读者我要写书评

暂无评论

Deep Feature-Based Text Clustering and Its Explanation 39

Deep Feature-Based Text Clustering and Its Explanation

引用

39th IEEE International Conference on Data engineering, ICDE 2023

作者： Guan, Renchu Zhang, Hao Liang, Yanchun Giunchiglia, Fausto Huang, Lan Feng, Xiaoyue Jilin University Key Laboratory for Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Changchun China University of Trento Disi Trento Italy

ISBN: (纸本)9798350322279

Text clustering is a critical step in text data analysis and has been extensively studied by the text mining community. Most existing text clustering algorithms are based on the bag-of-words model, which faces the high-dimensional and sparsity problems and ignores text structural and sequence information. Deep learning-based models such as convolutional neural networks and recurrent neural networks regard texts as sequences but lack supervised signals and explainable results. In this paper, we propose a deep feature-based text clustering (DFTC) framework that incorporates pretrained text encoders into text clustering tasks. This model, which is based on sequence representations, breaks the dependency on supervision. The experimental results show that our model outperforms classic text clustering algorithms on almost all the considered datasets. In addition, the explanation of the clustering results is significant for understanding the principles of the deep learning approach. Our proposed clustering framework includes an explanation module that can help users understand the meaning and quality of the clustering results. Our code is available at https://***/KEAML-JLU/DeepTextClustering. © 2023 IEEE.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Optimizing simple tabular reduction with a bitwise representation 25

Optimizing simple tabular reduction with a bitwise represent...

引用

25th International Joint Conference on Artificial Intelligence, IJCAI 2016

作者： Wang, Ruiwei Xia, Wei Yap, Roland H.C. Li, Zhanshan School of Software Jilin University Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering Education Ministry China School of Computing National University of Singapore Singapore

Maintaining Generalized Arc Consistency (GAC) during search is considered an efficient way to solve non-binary constraint satisfaction problems. Bit-based representations have been used effectively in Arc Consistency algorithms. We propose STRbit, a GAC algorithm, based on simple tabular reduction (STR) using an efficient bit vector support data structure. STRbit is extended to deal with compression of the underlying constraint with c-tuples. Experimental evaluation show our algorithms are faster than many algorithms (STR2, STR2-C, STR3, STR3-C and MDDc) across a variety of benchmarks except for problems with small tables where complex data structures do not payoff.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Traffic optimization for distributed network model base on Petri Nets

Traffic optimization for distributed network model base on P...

引用

Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST)

作者： Chang, Xin Pang, Huanli Hu, Liang Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China Collage of Computer Science and Engineering Changchun University of Technology Changchun 130012 China

ISBN: (纸本)9780769541396

Petri Nets is a powerful mathematical modeling tool for system description and analysis, with which we can describe the relationship among entities efficiently. The present thesis puts forward the modeling of the distributed computer network DNMPN and DNMPNTO based on Petri Nets. DNMPN implements the basic function of distributed computer network, and DNMPNTO modifies DNMPN's repetitive forward problem. Thus, it is efficiently helpful to optimize the unit traffic of the network, save the net work resource and improve the efficiency of the network system. © 2010 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：