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

Modified capacitor voltage balancing sorting algorithm for modular multilevel converter

JOURNAL OF ENGINEERING-JOE 2019年第16期2019卷 3315-3319页

作者： Zhang, Jie Liu, Jun Liu, Jiayu Fang, Wanliang Hou, Junxian Dong, Yifeng Xi An Jiao Tong Univ Shaanxi Key Lab Smart Grid Xian 710049 Shaanxi Peoples R China China Elect Power Res Inst Beijing 100085 Peoples R China

The modular multilevel converter (MMC) with large-scale sub-modules has the advantage of simpler modulation, lower switching frequency, and lower harmonic component, thus would be very promising in voltage source converter (VSC)-high voltage direct current transmission systems. Conventional capacitor voltage balancing algorithm suffers from insufficient grouping and sorting techniques. Therefore, it might result in excessive computation and high switching frequency of power electronic devices. To address the problem, a modified capacitor voltage balancing sorting algorithm is proposed in this paper. The proposed algorithm could avoid sorting all the module capacitor voltages by selecting only a certain number of the largest or smallest module capacitor voltages, and thus reduces time complexity greatly without losing control precision. Furthermore, the proposed algorithm focuses on the sub-modules whose capacitor voltage exceeds the limits, while the switching states of the other sub-modules are maintained to some degrees by employing the maintaining factor. Therefore, the switching frequency of the power electronic devices is further reduced. The performance of the proposed algorithm is evaluated through a time-domain MMC-HVDC simulation in PSCAD/EMTDC. Results show that the proposed algorithm is able to balance the module voltage with lower computation and reduce the switching frequency of power devices significantly, without noticeably increasing the capacitor voltage ripples.

关键词： HVDC power convertors power grids HVDC power transmission power transmission control computational complexity PWM power convertors capacitors voltage control power electronics electric current control power capacitors power convertors sorting power system simulation modified capacitor voltage sorting algorithm modular multilevel converter large-scale sub-modules simpler modulation lower switching frequency lower harmonic component VSC-high voltage direct current transmission systems sorting techniques high switching frequency power electronic devices largest capacitor voltages smallest module capacitor voltages switching states module voltage capacitor voltage ripples PSCAD EMTDC time-domain MMC-HVDC simulation

来源：评论

学校读者我要写书评

暂无评论

The Development of Model Learning Media of sorting algorithm

引用

Procedia - Social and Behavioral Sciences 2015年 197卷 1064-1068页

作者： Thitiporn Sittichailapa Rattanathip Rattanachai Polprasit Polvieng Computer Science Program at Suan Sunandha Rajabhat University 1 U-Thong Nok Road Dusit Bangkok 10300 Thailand

This paper is to develop a model based sorting-algorithm learning media. This model aims at studying steps of this algorithm through the use of animation. The work at this stage emphasizes modeling of Insertion Sort. We implemented this learning tool so that students can grasp the material intended in less time and with fun. The preliminary result being sampled from students of Computer Science Program at Suan Sunandha Rajabhat University is found to be satisfactory.

关键词： sorting algorithm Insertion Sort Computer Science Education Model Learning Media Suan Sunandha

来源：评论

学校读者我要写书评

暂无评论

The design and implementation of large data high-performance sorting algorithm

The design and implementation of large data high-performance...

引用

International Conference on Intelligent Transportation, Big Data and Smart City (ICITBS)

作者： Zhang Hai-jian Beijing Informat Technol Coll Beijing 100018 Peoples R China

This article mainly aims at the sorting algorithm of the era of big data analysis, for the ranking method of a series of corresponding research, and for the realization of the algorithm in this series.

ISBN: (纸本)9781509004645

关键词： Big data High performance sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

An Only-Once-sorting algorithm

引用

Wuhan University Journal of Natural Sciences 1996年第1期1卷 38-41页

作者： Xu Xusong Zhou Jianqin Guo Feng (School of Management,Wuhan University, Wuhan 430072,China) School of Management Wuhan University Wuhan China

This paper provides a new sorting algorithm called 'Only-Once-sorting' algorithm a mathemati cal formula,this algorithm can put elements in the positions they should be stored only once,then compacts *** algor... 详细信息

关键词： mathematical formula onlv-once-sorting sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

Concom sorting algorithm (Approach based on counting and comparison)

Concom Sorting Algorithm (Approach based on counting and com...

引用

International Conference on Computer Science and Network Technology

作者： Anand Agrawal Bhyravarapu Sriram Dept. of Computer Science and Engineering Vignan's University Guntur India

ISBN: (纸本)9781467381741

In Data Structures, sorting is a technique which is used for arranging data in a particular order either ascending or descending. sorting techniques like Bubble sort, Insertion sort and Selection sort are comparison based. Our proposed technique is a combination of both comparison and counting based techniques. We are finding the exact position of an element and placing it in its corresponding position. A sorting technique is said to be optimal based on its time & space complexity. The algorithm we designed is said to be optimal, based on the number of swap's compared to existing techniques like bubble sort, insertion sort.

关键词： sorting Concom_sort Time Complexity atomic array sorting programs complexity classes grade algorithmic approach sorting algorithm Optimal

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for FPGA Test Based on Partial Reconfiguration and sorting algorithm (Abstract Only) 15

A Novel Method for FPGA Test Based on Partial Reconfiguratio...

引用

Proceedings of the 2015 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays

作者： Xianjian Zheng Fan Zhang Lei Chen Zhiping Wen Yuanfu Zhao Xuewu Li Beijing Microelectronics Technology Institute Beijing China

ISBN: (纸本)9781450333153

The programmability of an FPGA poses a number of challenges when it comes to complete and comprehensive testing of the FPGA itself. A large number of configurations must be downloaded into the FPGA to test the programmable sources. A great many methods were proposed to reduce the number of configurations to minimize the test time, but few of papers were focus on reducing single configuration time. This paper proposes a novel method to reduce more than 30% of the total configuration time based on partial reconfiguration technology and sorting algorithm. This method is implemented on a series of SRAM-based FPGAs. The experimental result shows that this method reduces 30%-45% of the total configuration time and can be generally applied to all SRAM-based FPGAs currently.

关键词： fpga test partial reconfiguration sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

Randomized Shellsort: A Simple Oblivious sorting algorithm 10

Randomized Shellsort: A Simple Oblivious Sorting Algorithm

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Michael T. Goodrich Dept. of Computer Science University of California

ISBN: (纸本)9780898717013

In this paper, we describe a randomized Shellsort algorithm. This algorithm is a simple, randomized, data-oblivious version of the Shellsort algorithm that always runs in O(n log n) time and succeeds in sorting any given input permutation with very high probability. Taken together, these properties imply applications in the design of new efficient privacy-preserving computations based on the secure multi-party computation (SMC) paradigm. In addition, by a trivial conversion of this Monte Carlo algorithm to its Las Vegas equivalent, one gets the first version of Shellsort with a running time that is provably O(n log n) with very high probability.

关键词： sorting algorithm Runtime RANDOMISING secure multi-party computation logs logarithm (log)

来源：评论

学校读者我要写书评

暂无评论

Novel Hash-Based Radix sorting algorithm

Novel Hash-Based Radix Sorting Algorithm

引用

IEEE Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)

作者： Paul K. Mandal Abhishek Verma California State University Fullerton Fullerton USA New Jersey City University Jersey City NJ

ISBN: (纸本)9781728138862

sorting remains a quintessential problem in computer science; henceforth, considerable research has focused on optimizing runtime efficiency when sorting a collection of elements. Most algorithms for sorting objects are comparison-based. Bucket Sort and Radix Sort are non-comparison based sorting algorithms that can sort objects in linear time. In both cases, the corresponding array indices represent a hash for the object. Nevertheless, Radix Sort still requires an auxiliary array. In this paper, replacing Radix Sort's auxiliary array with a hash table is proposed. Use of a hash table in Radix Sort should avoid the calculations for the array and be better suited for handling objects. As with an array-based Radix sort, this hash-based approach should maintain linearity, thereby sorting objects more efficiently. Following successfully programming this novel sorting algorithm, as the number of elements increases, the runtime progresses linearly, not exponentially. Moreover, as the number of digits increases, the sorting runtime still lengthens linearly. Thus, a hash-based Radix sort is feasible and overcomes many issues associated with current sorting algorithms.

关键词： file organisation sorting radix sorting file organisation sorting programs Hash table grade sorting algorithm Runtime

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Robust Case sorting algorithm for Transient Stability Assessment

An Efficient and Robust Case Sorting Algorithm for Transient...

引用

IEEE Power and Energy Society General Meeting

作者： Yusheng Xue Tiangang Huang Kang Li Zhaoyang Dong Dong Yue Feng Xue Jie Huang Southeast University Queen's University Belfast School of EIE The University of Sydney Institute of Advanced Technology Nanjing University of Posts and Telecommunications State Grid EPRI

ISBN: (纸本)9781467380416

An efficient and robust case sorting algorithm based on Extended Equal Area Criterion (EEAC) is proposed in this paper for power system transient stability assessment (TSA). The time-varying degree of an equivalent image system can be deduced by comparing the analysis results of Static EEAC (SEEAC) and Dynamic EEAC (DEEAC), the former of which neglects all time-varying factors while the latter partially considers the time-varying factors. Case sorting rules according to their transient stability severity are set combining the time-varying degree and fault messages. Then a case sorting algorithm is designed with the "OR" logic among multiple rules, based on which each case can be identified into one of the following five categories, namely stable, suspected stable, marginal, suspected unstable and unstable. The performance of this algorithm is verified by studying 1652 contingency cases from 9 real Chinese provincial power systems under various operating conditions. It is shown that desirable classification accuracy can be achieved for all the contingency cases at the cost of very little extra computational burden and only 9.81% of the whole cases need to carry out further detailed calculation in rigorous on-line TSA conditions.

关键词： Transient stability Case sorting Time-varying characteristics Extended Equal Area Criterion (EEAC) transient stability time varying sorting algorithm power systems power system transient stability

来源：评论

学校读者我要写书评

暂无评论

An integrated convolutional neural network and sorting algorithm for image classification for efficient flood disaster management

引用

Decision Analytics Journal 2023年 7卷

作者： Islam, Md Azharul Rashid, Shawkh Ibne Hossain, Niamat Ullah Ibne Fleming, Robert Sokolov, Alexandr Mechanical Engineering Arkansas State University Jonesboro AR United States Faculty of Science Ontario Tech University Oshawa ON Canada Engineering Management Arkansas State University Jonesboro AR United States

Drones are used for post-flood disaster management and delivering relief goods to flood-affected areas. Autonomous drones are an alternative means of prioritizing assistance due to the lack of available technology and accessibility in many affected areas during floods. This study proposes a machine-learning approach designed and developed for autonomous drones to identify flood-affected areas with image classification. The proposed integrated approach can be used to deliver relief on a priority basis from the most affected areas to the least affected areas considering distance for efficiency. The proposed system uses a combined convolutional neural network (CNN) and sorting algorithm. The Inception v3 and DenseNet CNN approach can effectively detect flood severity. The Inception v3 shows better performance than DenseNet in terms of image classification. The Inception v3 and DenseNet architectures achieve 83% and 81% accuracy in our self-made flood level dataset, respectively. The integrated algorithm is used to sort the data efficiently. This study demonstrates the efficacy of CNN combined with a sorting algorithm for autonomous decision-making in robotic architecture. © 2023 The Author(s)

关键词： Convolutional neural network Disaster management Drone Flood Image classification sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：