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

9th International Conference on Advanced Computer Information Technologies (ACIT)

作者： Moroz, Olha Stepashko, Volodymyr NAS Int Res & Training Ctr Informat Technol & Syst Dept Informat Technol Induct Modeling Akad Glushkov Ave 40 UA-03680 Kiev Ukraine MES Ukraine Akad Glushkov Ave 40 UA-03680 Kiev Ukraine

The article presents a description of the combinatorial-genetic algorithm COMBI-GA as well as results of theoretical estimation of its computational complexity and numerical comparison of its effectiveness with known ... 详细信息

ISBN: (纸本)9781728104492

关键词： Combinatorial GMDH algorithm algorithm COMBI-GA algorithm complexity algorithm MULTI algorithm LASSO

来源：评论

学校读者我要写书评

暂无评论

Unit form recognition by mutations: Application of mutations in the search of positive roots

引用

DISCRETE APPLIED MATHEMATICS 2021年 291卷 223-236页

作者： Alves, Jesmmer Castonguay, Diane Brustle, Thomas Inst Fed Goiano Campus Morrinhos Morrinhos Morrinhos Go Brazil Univ Fed Goias Inst Informat Goiania Go Brazil Univ Sherbrooke Fac Sci Sherbrooke PQ Canada

The quadratic forms are algebraic expressions that have important role in different areas of computer science, mathematics, physics, statistics and others. We deal with quadratic forms that are widely used in the study of algebras with finite representation type, called unit forms. Especially, we study unit forms q : Z(n)-> Z by means of their associated edge-bipartite signed (multi)graphs without loops. A big challenge in this field is to develop efficient algorithms to recognize the type of a given unit form. Actually, most algorithms can demand a long time on this task and becomes infeasible. Our aim is to present a new strategy, do the unit form recognition through sequences of mutations in the unit form related exchange matrix P. For that, we show that the positive roots of the unit form are in the c-matrix of P. We also present an algorithm to recognize the type of a given unit form, implemented using BFS (Breadth First Search) and using powerful techniques to simplify this process. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Graph theory Signed graphs Integral quadratic form Mutations algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights

引用

OPTIMIZATION LETTERS 2021年第6期15卷 2311-2319页

作者： Lv, Dan-Yang Wang, Ji-Bo Shenyang Aerosp Univ Sch Sci Shenyang Peoples R China

In a recent paper, Jiang et al. (EngOptim 52(1):37-52, 2020) considered proportionate flowshop scheduling with position-dependent weights. For common and slack due-date assignment problems, they proved that both of these two problems can be solved in O(n(2) log n) time, where n is the number of jobs. The contribution of this paper is that we show that these two problems can be optimally solved by a lower-order algorithm, i.e., in O(n log n) time.

关键词： Scheduling Proportionate flowshop Due-date assignment Optimal solution algorithm algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

An empirical estimation for time and memory algorithm complexities: newly developed R package

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2021年第2期80卷 2997-3015页

作者： Agenis-Nevers, Marc Bokde, Neeraj Dhanraj Yaseen, Zaher Mundher Shende, Mayur Kishor Epictr Factory Clermont Ferrand France Aarhus Univ Dept Engn Renewable Energy & Thermodynam Aarhus Denmark Ton Duc Thang Univ Sustainable Dev Civil Engn Res Grp Fac Civil Engn Ho Chi Minh City Vietnam Govt Coll Engn Nagpur Maharashtra India

When an algorithm or a program runs on a computer, it requires some resources. The complexity of an algorithm is the measure of the resources, for some input. These complexities are usually space and time. The subject of the empirical computational complexity has been studied in the research. This article introduces GuessCompx which is an R package that performs an empirical estimation on the time and memory complexities of an algorithm or a function, and provides a reliable, convenient and simple procedure for estimation process. It tests multiple increasing-sizes samples of the user's data and attempts to fit one of seven complexity functions:O(N), O(N2), O(log(N)), etc. In addition, based on the best fit procedure using leave one out-mean squared error (LOO-MSE), it predicts the full computation time and memory usage on the whole dataset. Together with this results, a plot and a significance test are returned. complexity is assessed with regard to the user's actual dataset through its size (and no other parameter). This article provides several examples demonstrating several cases (e.g., distance function, time series and custom function) and optimal parameters tuning.

关键词： Time complexity Memory complexity Empirical approach R package algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

Parallel Implementation of Model Predictive Control for Multilevel Cascaded H-Bridge STATCOM With Linear complexity

引用

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS 2020年第2期67卷 832-841页

作者： Zhang, Yonglei Yuan, Xibo Wu, Xiaojie Yuan, Yalei Zhou, Juan China Univ Min & Technol Sch Elect & Power Engn Xuzhou 221116 Jiangsu Peoples R China Univ Bristol Dept Elect & Elect Engn Bristol BS8 1UB Avon England

The algorithm complexity of model predictive control (MPC) for cascaded H-bridge (CHB) static synchronous compensators (STATCOMs) was optimized to a polynomial level in previous studies. However, implementing MPC with conventional approaches still suffers from long execution time, where a low cost digital signal processor (DSP) is used to execute optimization algorithms and a small-sized field-programmable gate array (FPGA) is used to extend gate signals and sampling functions. This paper presents a parallel implementation approach to reduce the execution time of MPC, where the FPGA is configured to be used for accelerating the high-complexity sorting tasks. By running the DSP and FPGA in parallel, the algorithm execution time is only determined by the DSP, and the resource consumption is only determined by the FPGA. To minimize the resource consumption and requirement in FPGA, a parallel comparison-based sorter with multiple comparison and accumulators is proposed. The proposed implementation method can reduce the time and space complexity of the MPC from the polynomial level to a linear level without additional hardware cost, which means the MPC for medium-voltage CHB STATCOMs (e.g., 20 stages) can be implemented online with existing control platforms. Experimental results for various CHB STATCOMs are presented to validate the proposed configuration and algorithm.

关键词： algorithm complexity cascaded H-bridge (CHB) model predictive control (MPC) static synchronous compensators (STATCOM)

来源：评论

学校读者我要写书评

暂无评论

Note on single machine common flow allowance group scheduling with learning effect and resource allocation

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2023年 186卷

作者： Qian, Jin Northeastern Univ Dept Math Coll Sci Shenyang Peoples R China

Recent papers (Sun et al., 2020;Lv et al., 2021), they studied single machine due date assignment scheduling problems with learning effect and resource allocation. In this note, we show that the published results of Sun et al. (2020) and Lv et al. (2021) are incorrect by two counter-examples. Then the corrected results are provided, and we also explain why they are incorrect.

关键词： Scheduling Due date assignment Learning effect Resource allocation algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Manta Ray Foraging Optimization with Weighted Fitness-Distance Balance Selection

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS 2023年第1期16卷 114-114页

作者： Tang, Zhentao Wang, Kaiyu Tao, Sichen Todo, Yuki Wang, Rong-Long Gao, Shangce Jiangsu Agrianim Husb Vocat Coll Taizhou 225300 Peoples R China Univ Toyama Fac Engn Toyama 9308555 Japan Kanazawa Univ Fac Elect Informat & Commun Engn Kanazawa 9201192 Japan Univ Fukui Fac Engn Fukui 9108507 Japan

Manta ray foraging optimization (MRFO) tends to get trapped in local optima as it relies on the direction provided by the previous individual and the best individual as guidance to search for the optimal solution. As enriching population diversity can effectively solve this problem, in this paper, we introduce a hierarchical structure and weighted fitness-distance balance selection to improve the population diversity of the algorithm. The hierarchical structure allows individuals in different groups of the population to search for optimal solutions in different places, expanding the diversity of solutions. In MRFO, greedy selection based solely on fitness can lead to local solutions. We innovatively incorporate a distance metric into the selection strategy to increase selection diversity and find better solutions. A hierarchical manta ray foraging optimization with weighted fitness-distance balance selection (HMRFO) is proposed. Experimental results on IEEE Congress on Evolutionary Computation 2017 (CEC2017) functions show the effectiveness of the proposed method compared to seven competitive algorithms, and the proposed method has little effect on the algorithm complexity of MRFO. The application of HMRFO to optimize real-world problems with large dimensions has also obtained good results, and the computational time is very short, making it a powerful alternative for very high-dimensional problems. Finally, the effectiveness of this method is further verified by analyzing the population diversity of HMRFO.

关键词： Manta ray foraging optimization Local optima Population diversity Hierarchical structure Greedy selection Weighted fitness-distance balance selection algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

algorithm for visualizing substation areas in electric power systems

引用

EXPERT SYSTEMS WITH APPLICATIONS 2023年 212卷

作者： Kovacev, Nemanja Gavric, Milan Lendak, Imre Univ Novi Sad Fac Tech Sci Trg Dositeja Obradov 6 Novi Sad 21000 Vojvodina Serbia Eotvos Lorand Univ Data Sci & Engn Dept Fac Informat Pazmany Peter Setany 1-A H-1117 Budapest Hungary

Electric power distribution systems can be represented with mathematical graphs in which the hub nodes are substations receiving electric power from the transmission system and delivering it to the consumers via feeders consisting of transformers, junctions, cables and power lines. High-quality diagrams depicting these systems are key elements of efficient monitoring and control. Existing automatic diagram generation solutions are usually limited to drawing single feeders or contain significant simplifications of the underlying distribution system e.g., visualize multiple feeders with their interconnections removed. The goal of this research was to develop an algorithm capable of generating visually-pleasing diagrams of substation areas consisting of a single hub node and a complex network of thousands of interconnected elements. The resulting algorithm was defined as a sequence of transformations which takes a mathematical graph as input and generates a one-line diagram as output. Multiple novel approaches are incorporated to optimize the algorithm thereby allowing it to run efficiently on regular desktop computers. Also, a novel diagram quality evaluation procedure was developed to automatically measure and compare the usability of each generated diagram. The algorithm was tested on 2510 different substation areas of various complexity extracted from the network models of real-life, European distribution systems. The quality of the generated diagrams was measured with the novel evaluation procedure and verified with a human domain experts on a subset of the resulting diagrams. Based on these analyses, it was concluded that the generated diagrams are usable in newly built supervisory and control systems with minimum human intervention.

关键词： One-line diagram Graph visualization Electric power system Substation area algorithm complexity Diagram evaluation procedure

来源：评论

学校读者我要写书评

暂无评论

Quantum algorithm and experimental demonstration for the subset sum problem

引用

Science China(Information Sciences) 2022年第8期65卷 261-274页

作者： Qilin ZHENG Pingyu ZHU Shichuan XUE Yang WANG Chao WU Xinyao YU Miaomiao YU Yingwen LIU Mingtang DENG Junjie WU Ping XU Institute for Quantum Information and State Key Laboratory of High Performance Computing College of Computer Science and TechnologyNational University of Defense Technology

To solve the subset sum problem, a well-known nondeterministic polynomial-time complete problem that is widely used in encryption and resource scheduling, we propose a feasible quantum algorithm that utilizes fewer qubits to encode and achieves quadratic speedup. Specifically, this algorithm combines an amplitude amplification algorithm with quantum phase estimation, and requires n + t + 1 qubits and O(2(0.5+o(1))n) operations to obtain the solution, where n is the number of elements, and t is the number of qubits used to store the eigenvalues. To verify the performance of the algorithm, we simulate the algorithm with the online quantum simulator of IBM named ibmq simulator using Qiskit and then run it on two IBM quantum computers called ibmq santiago and ibmq bogota. The experimental results indicate that compared with the brute force algorithm, the proposed algorithm results in quadratic acceleration for the problem of a set S with four elements and two subsets whose sum equals target w. Using the iterator twice, we obtain success probabilities of 0.940 ± 0.004, 0.751 ± 0.040, and 0.665 ± 0.060 on the simulator, ibmq santiago, and ibmq bogota, respectively, and the fidelity between the theoretical and experimental quantum states is calculated to be 0.944 ± 0.002, 0.753 ± 0.017, and 0.657 ± 0.028, respectively. If the error rates of the experimental quantum logic gates can be reduced, the success probabilities of the proposed algorithm on real quantum devices can be further improved.

关键词： quantum algorithm subset sum quadratic speedup encryption algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

Methods for Optimizing Software Performance

Methods for Optimizing Software Performance

引用

IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus)

作者： Efremov, Egor A. Chufistov, Alexander A. Mukaev, Rinat R. Skvortsov, Vadim Bauman Moscow State Tech Univ Dept Informat & Control Syst Moscow Russia

ISBN: (纸本)9781665404761

Studying various ways and methods of using hardware resources efficiently in order to optimize software performance is one of the most interesting and most important tasks of computer engineers. This study analyzes the estimation of algorithm complexity and the impact of algorithms complexities on software performance. Special attention has been given to the main problems of increasing performance and access time to RAM and hard disk. The main methods which have been used to solve the performance problem have been described. In practical implementation, an algorithm has been developed for processing a large array of objects.

关键词： performance complexity estimation optimization algorithm complexity recursion memory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：