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

20th Mexican International Conference on Artificial Intelligence (MICAI)

作者： Leonardo Gonzalez-Ruiz, J. Raymundo Marcial-Romero, J. Hernandez, J. A. De-Ita, Guillermo Univ Autonoma Estado Mexico Fac Ingn Cerro Coatepec S-NCiudad Univ Toluca 50100 Mexico Benemerita Univ Autonoma Puebla 4 Sur 104 Ctr Hist Puebla 72000 Mexico

ISBN: (纸本)9783030898205;9783030898199

In this paper, we present an algorithm to approximate the clique-width of a graph. The proposed approach is based on computing the shortest paths between pairs of vertices. We experimentally show that our proposal approximates the clique-width of simple graphs in polynomial time, while other methods that calculate it in an exact way, transform the problem to SAT, that is well-known as NP-Complete.

关键词： Graph theory Clique-width algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

UAV Task Allocation Method Using Swarm Intelligence Optimization algorithm 15th

UAV Task Allocation Method Using Swarm Intelligence Optimiza...

引用

15th China Conference on Wireless Sensor Networks (CWSN)

作者： Shi, Jiaqi Tan, Li Lian, Xiaofeng Xu, Tianying Zhang, Hongtao Beijing Technol & Business Univ Sch Comp Sci & Engn Beijing 100048 Peoples R China Beijing Technol & Business Univ Sch Artificial Intelligence Beijing 100048 Peoples R China

ISBN: (纸本)9789811681745;9789811681738

The multi-unmanned aerial vehicle (UAV) task allocation method has shortcomings such as long flight distance and long algorithm initialization time. In response to these problems, this paper proposes a UAV task allocation method based on Swarm Intelligence Optimization algorithm (SIOA). The algorithm first compares the relationship between the number of UAVs and mission points when UAV is performing a task, and then introduces the idea of gradient descent to reduce the flying distance of UAV. Experimental results show that the SIOA method can effectively reduce the initialization time, shorten search distance of the UAV and the time UAV complete the task, and effectively solve the problem of high algorithm complexity.

关键词： Task allocation Swarm intelligence optimization algorithm algorithm complexity Initialization time Gradient descent

来源：评论

学校读者我要写书评

暂无评论

Joint estimation of DOA and polarisation for radar signals based on dual-polarised antenna array

引用

IET MICROWAVES ANTENNAS & PROPAGATION 2020年第10期14卷 989-998页

作者： Wu, Jian Zhu, Xiaojin He, Xiaoming Gao, Zhiyuan Fang, Yubin Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200072 Peoples R China Shanghai Microwave Equipment Res Inst Shanghai 201802 Peoples R China

To apply polarisation information of radar signal in radar reconnaissance equipment, a joint estimation algorithm of the radar signal direction of arrival (DOA) and polarisation parameters based on dual-polarisation antenna array has been researched in this study. The mathematical model of dual-polarised circular array has been given, and the joint estimation method of DOA and polarisation parameters for radar signal based on multiple signal classification (MUSIC) algorithm has been analysed. To overcome the shortcomings such as high calculation cost for the MUSIC algorithm, the DOA-matrix algorithm has been presented. DOA-matrix algorithm can effectively distinguish the radar signals with different polarisation states in the same direction by use of eigen-decomposition of the DOA-matrix. Through matrix correlation calculation, spectral peak search has been avoided, and the computational cost and algorithm complexity are greatly reduced. Finally, the feasibility of the DOA-matrix algorithm has been simulated and analysed. The simulation results show that the DOA-matrix algorithm can effectively complete the joint estimation of DOA and polarisation parameters for radar signal. The running time reaches millisecond level, which has a strong application value in engineering.

关键词： array signal processing radar signal processing matrix algebra antenna arrays direction-of-arrival estimation polarisation signal classification DOA-matrix algorithm different polarisation states computational cost algorithm complexity polarisation parameters dual-polarised antenna array polarisation information radar reconnaissance equipment joint estimation algorithm radar signal direction dual-polarisation antenna array dual-polarised circular array joint estimation method multiple signal classification algorithm MUSIC algorithm

来源：评论

学校读者我要写书评

暂无评论

A Parallelizable Integer Linear Programming Approach for Tiling Finite Regions of the Plane with Polyominoes

引用

algorithmS 2022年第5期15卷 164-164页

作者： Garvie, Marcus R. Burkardt, John Univ Guelph Dept Math & Stat Guelph ON N1G 2W1 Canada Univ Pittsburgh Dept Math Pittsburgh PA 15260 USA

The general problem of tiling finite regions of the plane with polyominoes is NP-complete, and so the associated computational geometry problem rapidly becomes intractable for large instances. Thus, the need to reduce algorithm complexity for tiling is important and continues as a fruitful area of research. Traditional approaches to tiling with polyominoes use backtracking, which is a refinement of the 'brute-force' solution procedure for exhaustively finding all solutions to a combinatorial search problem. In this work, we combine checkerboard colouring techniques with a recently introduced integer linear programming (ILP) technique for tiling with polyominoes. The colouring arguments often split large tiling problems into smaller subproblems, each represented as a separate ILP problem. Problems that are amenable to this approach are embarrassingly parallel, and our work provides proof of concept of a parallelizable algorithm. The main goal is to analyze when this approach yields a potential parallel speedup. The novel colouring technique shows excellent promise in yielding a parallel speedup for finding large tiling solutions with ILP, particularly when we seek a single (optimal) solution. We also classify the tiling problems that result from applying our colouring technique according to different criteria and compute representative examples using a combination of MATLAB and CPLEX, a commercial optimization package that can solve ILP problems. The collections of MATLAB programs PARIOMINOES (v3.0.0) and POLYOMINOES (v2.1.4) used to construct the ILP problems are freely available for download.

关键词： tiling with polyominoes checkerboard colouring arguments integer linear programming parallelizable algorithm algorithm complexity MATLAB CPLEX

来源：评论

学校读者我要写书评

暂无评论

N-Step Sliding Recursion Formula of Variance and Its Implementation

引用

JOURNAL OF INFORMATION PROCESSING SYSTEMS 2020年第4期16卷 832-844页

作者： Yu, Lang He, Gang Mutahir, Ahmad Khwaja Southwest Univ Sci & Technol Sch Sci Mianyang Sichuan Peoples R China Southwest Univ Sci & Technol Sch Comp Sci & Technol Mianyang Sichuan Peoples R China

The degree of dispersion of a random variable can be described by the variance, which reflects the distance of the random variable from its mean. However, the time complexity of the traditional variance calculation algorithm is O(n), which results from full calculation of all samples. When the number of samples increases or on the occasion of high speed signal processing, algorithms with O(n) time complexity will cost huge amount of time and that may results in performance degradation of the whole system. A novel multi-step recursive algorithm for variance calculation of the time-varying data series with O(1) time complexity (constant time) is proposed in this paper. Numerical simulation and experiments of the algorithm is presented and the results demonstrate that the proposed multi-step recursive algorithm can effectively decrease computing time and hence significantly improve the variance calculation efficiency for time-varying data, which demonstrates the potential value for time-consumption data analysis or high speed signal processing.

关键词： algorithm complexity Multi-Step Recursion algorithm Sliding Window Variance

来源：评论

学校读者我要写书评

暂无评论

Third-order complex delta-sigma modulator with arbitrary poles and zeros placement

引用

ELECTRONICS LETTERS 2020年第2期56卷 71-72页

作者： Li, Chuan You, Fei Wang, Jinchen Huang, Jiajun He, Songbai Univ Elect Sci & Technol China Sch Elect Sci & Engn Chengdu 611731 Peoples R China

A third-order complex delta-sigma modulation (CDSM) structure with cross-coupling paths is proposed and analysed. Although the conventional CDSM can reduce circuits complexity in digital transmitter systems, it suffers from other shortcomings like increasing algorithm complexity. This structure imports cross-coupling paths both at output and interstage, which realises decorrelation between zeros and poles. The advantage is that complex zeros can be arbitrarily placed, and thus, the reconfigurable digital wireless transmitter application can be satisfied;and the poles are not affected by zeros placement, which improves the flatness of signal transfer function.

关键词： delta-sigma modulation transfer functions circuit complexity poles and zeros zeros placement third-order complex delta-sigma modulation structure conventional CDSM circuits complexity digital transmitter systems algorithm complexity cross-coupling paths complex zeros reconfigurable digital wireless transmitter application arbitrary poles and zeros placement third order complex delta-sigma modulator CDSM structure signal transfer function

来源：评论

学校读者我要写书评

暂无评论

Important complexity Reduction of Random Forest in Multi-Classification Problem 15

Important Complexity Reduction of Random Forest in Multi-Cla...

引用

15th IEEE International Wireless Communications and Mobile Computing Conference (IEEE IWCMC)

作者： Hassine, Kawther Erbad, Aiman Hamila, Ridha Qatar Univ Coll Engn Dept Comp Sci & Engn Doha Qatar Qatar Univ Coll Engn Dept Elect Engn Doha Qatar

ISBN: (纸本)9781538677476

algorithm complexity in machine learning problems has been a real concern especially with large-scaled systems. By increasing data dimensionality, a particular emphasis is placed on designing computationally efficient learning models. In this paper, we propose an approach to improve the complexity of a multi-classification learning problem in cloud networks. Based on the Random Forest algorithm and the highly dimensional UNSW-NB 15 dataset, a tuning of the algorithm is first performed to reduce the number of grown trees used during classification. Then, we apply an importance-based feature selection to optimize the number of predictors involved in the learning process. All of these optimizations, implemented with respect to the best performance recorded by our classifier, yield substantial improvement in terms of computational complexity both during training and prediction phases.

关键词： algorithm complexity Feature selection Random Forest Predictor importance

来源：评论

学校读者我要写书评

暂无评论

MultiPLZW: A novel multiple pattern matching search in LZW-compressed data

引用

COMPUTER COMMUNICATIONS 2019年 145卷 126-136页

作者： Aldwairi, Monther Hamzah, Abdulmughni Y. Jarrah, Moath Jordan Univ Sci & Technol Comp & Informat Technol Fac POB 3030 Irbid 22110 Jordan Zayed Univ Coll Technol Innovat POB 144534 Abu Dhabi U Arab Emirates

Searching encrypted or compressed data provides security and privacy without sacrificing efficiency. It has many applications in cloud storage, bioinformatics, IoT, unmanned aerial vehicles and drones. This paper introduces a novel, simple, and efficient algorithm to locate all occurrences of a set of patterns in LZW-compressed data, in a single pass. The algorithm comprises a preprocessing phase and a subsequent search phase. It uses a modified version of the generalized suffix tree, a lookup table, a mapping table, and a history tree. The proposed algorithm is superior in terms of the time complexity, while maintaining a space complexity of the same order as the best of existing algorithms. The time complexity is O(n+m+r), which is proportional to the length of the ***, where n is the length of the compressed data, m is the total size of the patterns, and r is the number of pattern occurrences in the compressed data. The space complexity is O(m(2)+t+r), where t is the size of the dictionary table that is used during compression. Experimental results show a significant improvement in search time, approximately twice as fast, compared to decompressing and then searching using Aho-Corasick algorithm. Also, results on various dataset sizes, demonstrate the algorithm's superior scalability, which improves as the size of the dataset increases.

关键词： Aho-Corasick algorithm Compressed data LZW compression Pattern matching algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

A Rank 18 Waring Decomposition of sM⟨3⟩ with 432 Symmetries

引用

EXPERIMENTAL MATHEMATICS 2019年第3期30卷 383-385页

作者： Conner, Austin Texas A&M Univ Dept Math Mailstop 3368 College Stn TX 77843 USA

The recent discovery that the exponent of matrix multiplication is determined by the rank of the symmetrized matrix multiplication tensor has invigorated interest in better understanding symmetrized matrix multiplicat... 详细信息

关键词： Matrix multiplication tensor rank tensor symmetry algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

A Novel Real-Valued DOA algorithm Based on Eigenvalue

引用

SENSORS 2020年第1期20卷 40-40页

作者： Yang, De-Sen Chen, Feng Mo, Shi-Qi Harbin Engn Univ Acoust Sci & Technol Lab Harbin 150001 Peoples R China Harbin Engn Univ Minist Ind & Informat Technol Key Lab Marine Informat Acquisit & Secur Harbin 150001 Peoples R China Harbin Engn Univ Coll Underwater Acoust Engn Harbin 150001 Peoples R China

To solve the high complexity of the subspace-based direction-of-arrival (DOA) estimation algorithm, a super-resolution DOA algorithm is built in this paper. However, in this method, matrix decomposition is required for each search angle. Therefore, in this paper, real-valued processing is used to reduce the scanning range by half, which is less effective in algorithm complexity. The super-resolution algorithm mainly uses the conservation of energy. By exploring the relationship between the covariance matrix and its complex conjugate, we constructed the real-valued matrix and introduced a real-valued searching source to make the operation of the matrix real-valued. Finally, the simulation experiments show that the proposed algorithm not only reduces the spectral search range by half but also has a higher angular resolution than the traditional algorithm.

关键词： DOA super-resolution real-valued processing algorithm complexity search range

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：