In this paper, the traditional ant colony algorithm has a slow convergence rate for routing optimization of Mesh networks. A multi-path routing protocol based on improved ant colony algorithm, Fortified Ant protocol, ...
详细信息
In this paper, the traditional ant colony algorithm has a slow convergence rate for routing optimization of Mesh networks. A multi-path routing protocol based on improved ant colony algorithm, Fortified Ant protocol, is proposed. The protocol first adds a sorting algorithm based on the ant colony algorithm, and introduces the concept of elite ants to improve the speed of routing optimization. Secondly, this paper also studies the multipath transmission of self-organizing networks. The simulation results show that compared with ADOV, DSR and AOC routing algorithms, the algorithm can quickly find multiple paths with better quality, with fast convergence and overhead. Less advantage. (C) 2020 The Authors. Published by Elsevier B.V.
We present efficient parallel recursive divide-and-conquer algorithms for bubble sort, selection sort, and insertion sort. Our algorithms have excellent data locality and are highly parallel. The computational complex...
详细信息
We present efficient parallel recursive divide-and-conquer algorithms for bubble sort, selection sort, and insertion sort. Our algorithms have excellent data locality and are highly parallel. The computational complexity of our insertion sort is O(n(log23)) in contrast to O(n(2)) of standard insertion sort.
This study presents a 6-module cascaded Hbridgemultilevel converter design for AC split batteries in residential applications. It incorporates sorting-based balancing and level-shifted modulation for reduced harmonic ...
详细信息
ISBN:
(纸本)9798350316643
This study presents a 6-module cascaded Hbridgemultilevel converter design for AC split batteries in residential applications. It incorporates sorting-based balancing and level-shifted modulation for reduced harmonic distortion and current ripple. Two current controllers, PR and dq controllers, are employed for grid synchronization and quality control, with a focus on comparing their performance in terms of harmonic distortion, settling time, and steady-state error. Simulation results validate the effectiveness of sub-batteries balancing method during charging and discharging, and the stability of both controllers against the 5th and 7th harmonic distortion. Additionally, an experimental prototype with 6 battery emulators confirms the feasibility of the system and sorting algorithm.
The core problem of information retrieval is concentrated in the document for the user to retrieve the most relevant sub-set of documents, relying on sorting algorithms on the search results according to relevance sor...
详细信息
ISBN:
(纸本)9783037859865
The core problem of information retrieval is concentrated in the document for the user to retrieve the most relevant sub-set of documents, relying on sorting algorithms on the search results according to relevance sort, sorted the results as the user asked the query response information retrieval performance is determined by many factors, such as to query expressions quality index stemmer nonsense word disabled, query expansion technology, but fundamentally it is determined by the sort function sort function in some Standards document query indicates the degree of matching with the user, and accordingly to make a document with respect to the user's judgment, then the document in accordance with the degree of correlation with respect to the user in descending order, and returns the ordered list of documents as a result of the retrieval the pros and cons of the sorting algorithm directly affect the efficiency of the retrieval.
Aimed at uniformity of sorting about analytic hierarchy process(AHP),analytic hierarchy process based on grey incidence is brought *** sorting results are got through ways of different weights and several ***,overcomi...
详细信息
ISBN:
(纸本)9781479934348
Aimed at uniformity of sorting about analytic hierarchy process(AHP),analytic hierarchy process based on grey incidence is brought *** sorting results are got through ways of different weights and several ***,overcoming uniformity of sorting,complex process of rectifying judgment Matrix and consistence verification,that favor to analysis difference of algorithm and correctness of sorting results, more science and equitable sorting result is gained,it favor extension and application of AHP.
We propose a novel zero-shot document ranking approach based on Large Language Models (LLMs): the Setwise prompting approach. Our approach complements existing prompting approaches for LLM-based zero-shot ranking: Poi...
详细信息
ISBN:
(纸本)9798400704314
We propose a novel zero-shot document ranking approach based on Large Language Models (LLMs): the Setwise prompting approach. Our approach complements existing prompting approaches for LLM-based zero-shot ranking: Pointwise, Pairwise, and Listwise. Through the first-of-its-kind comparative evaluation within a consistent experimental framework and considering factors like model size, token consumption, latency, among others, we show that existing approaches are inherently characterised by trade-offs between effectiveness and efficiency. We find that while Pointwise approaches score high on efficiency, they suffer from poor effectiveness. Conversely, Pairwise approaches demonstrate superior effectiveness but incur high computational overhead. Our Setwise approach, instead, reduces the number of LLM inferences and the amount of prompt token consumption during the ranking procedure, compared to previous methods. This significantly improves the efficiency of LLM-based zero-shot ranking, while also retaining high zero-shot ranking effectiveness. We make our code and results publicly available at https://***/ielab/llm-rankers.
We introduce a new sorting device for permutations, which we call popqueue. It consists of a special queue, having the property that any time one wants to extract elements from the queue, actually all the elements cur...
详细信息
We introduce a new sorting device for permutations, which we call popqueue. It consists of a special queue, having the property that any time one wants to extract elements from the queue, actually all the elements currently in the queue are poured into the output. We illustrate two distinct optimal algorithms, called Min and Cons, to sort a permutation using such a device, which allow us also to characterize sortable permutations in terms of pattern avoidance. We next investigate what happens by making two passes through a popqueue, showing that the set of sortable permutations is not a class for Min, whereas it is for Cons. In the latter case we also explicitly find the basis of the class of sortable permutations. Finally, we study preimages under Cons (by means of an equivalent version of the algorithm), and find a characterization of the set of preimages of a given permutation. We also give some enumerative results concerning the number of permutations having k preimages, for k = 1, 2, 3, and we conclude by observing that there exist permutations having k preimages for any value of k >= 0.
This study explores the application of parallel algorithms to enhance large-scale sorting, focusing on the QuickSort method. Implemented in both sequential and parallel forms, the paper provides a detailed comparison ...
详细信息
This study explores the application of parallel algorithms to enhance large-scale sorting, focusing on the QuickSort method. Implemented in both sequential and parallel forms, the paper provides a detailed comparison of their performance. This study investigates the efficacy of both techniques through the lens of array generation and pivot selection to manage datasets of varying sizes. This study meticulously documents the performance metrics, recording 16,499.2 milliseconds for the serial implementation and 16,339 milliseconds for the parallel implementation when sorting an array by using C++ chrono library. These results suggest that while the performance gains of the parallel approach over its serial counterpart are not immediately pronounced for smaller datasets, the benefits are expected to be more substantial as the dataset size increases.
Modifying an algorithm that has been established over many years and making it even faster has always been a fascinating and challenging area in the field of algorithms, which motivated us to take the challenge of imp...
详细信息
This paper presents an online estimation technique Kalman filter-based able to evaluate both the open circuit voltage and the internal resistance of the battery cells installed within the Reconfigurable Cascaded Multi...
详细信息
暂无评论