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 conv...
详细信息
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.
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. ...
详细信息
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.
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
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.
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...
详细信息
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 *** algorithm completes sorting a sequence of n elements in a calculation time of O(n ).
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 b...
详细信息
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.
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 program...
详细信息
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.
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 gi...
详细信息
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 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 a...
详细信息
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.
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 im...
详细信息
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.
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...
详细信息
暂无评论