Integrating renewable energy sources, electric vehicles, and storage systems into power grids demands advanced control and monitoring systems. Precise current sensors are a critical component of these systems, essenti...
详细信息
In today's digital age, there's a growing demand for a dependable system that can recognize handwritten text. This demand comes from various industries as well as individual users, highlighting the importance ...
详细信息
Given n elements, an integer k ≤ n/2 and a parameter Ε ≥ 1/n , we study the problem of selecting an element with rank in (k − nΕ, k + nΕ] using unreliable comparisons where the outcome of each comparison is incor...
详细信息
ISBN:
(纸本)9783959772662
Given n elements, an integer k ≤ n/2 and a parameter Ε ≥ 1/n , we study the problem of selecting an element with rank in (k − nΕ, k + nΕ] using unreliable comparisons where the outcome of each comparison is incorrect independently with a constant error probability, and multiple comparisons between the same pair of elements are independent. In this fault model, the fundamental problems of finding the minimum, selecting the k-th smallest element and sorting have been shown to require Θ(n log 1/Q), Θ(n log k/Q) and Θ(n log n/Q) comparisons, respectively, to achieve success probability 1 − Q [9]. Considering the increasing complexity of modern computing, it is of great interest to develop approximation algorithms that enable a trade-off between the solution quality and the number of comparisons. In particular, approximation algorithms would even be able to attain a sublinear number of comparisons. Very recently, Leucci and Liu [23] proved that the approximate minimum selection problem, which covers the case that k ≤ nΕ, requires expected Θ(Ε−1 log 1/Q) comparisons, but the general case, i.e., for nΕ −2 log 1/Q) comparisons to achieve success probability at least 1 − Q. For k = nΕ, the number of comparisons is O(Ε−1 log 1/Q), matching Leucci and Liu’s result [23], whereas for k = n/2 (i.e., approximating the median), the number of comparisons is O(Ε−2 log 1/Q). We also prove that even in the absence of comparison faults, any randomized algorithm with success probability at least 1 − Q performs expected Ω(min{n, k/n Ε−2 log 1/Q }) comparisons. As long as n is large enough, i.e., when n = Ω(k/n Ε−2 log 1/Q), our lower bound demonstrates the optimality of our algorithm, which covers the possible range of attaining a sublinear number of comparisons. Surprisingly, for constant Q, our algorithm performs expected O(k/n Ε−2) comparisons, matching the best possible approximation algorithm in the absence of computation faults. In contrast, for the exact selection problem, the expe
The modern era has witnessed a heightened level of global news exposure in recent years. We all are updated with any news, be it the economic news of our country, the political news, national or international calamiti...
详细信息
Conversational agents are increasingly present in the context of Industry 4.0, in particular for customer care applications. To be really useful, these agents must correctly recognize the users' intents in order t...
详细信息
Ovarian cancer is a cancerous tumor in the ovary. To assist with its diagnosis, machine learning models can be used to predict ovarian cancer based on the data available from medical tests. We use data (in terms of fe...
详细信息
This paper aims to analyze the correlation between programming languages used to implement smart contracts and the related Blockchain platforms, seeking an economically and environmentally viable solution. The researc...
详细信息
We employ Convolutional Neural Network to predict the lift coefficient for a new airfoil shape. Our proposed con-volutional neural network efficiently uses an artificially created image to map it to its lift coefficie...
详细信息
The high power DC-DC converters are widely used in industrial and renewable application due to variable dc source. For this purpose, the interleaved dual cascade DCDC converter (IDCC) is the most advantageous due to i...
详细信息
Nation’s rapid urbanization growth and economic development, waste generation has significantly increased. An important environmental concern on a global scale is waste management. In a majority of the world’s natio...
详细信息
暂无评论