The increasing occurrence of high probability events and the absence of a universal resilience metric have shifted the research paradigm towards quantifying resilience to support adaptive restoration. Thus, there is a...
详细信息
This study proposes a hybrid optimization-based mobility management strategy employing Kinetic Gas Molecular Optimization (KGMO) and Ant Lion Optimization (ALO). Initially, KGMO calculates particle properties, such as...
详细信息
Coping with noise in computing is an important problem to consider in large systems. With applications in fault tolerance (Hastad et al., 1987;Pease et al., 1980;Pippenger et al., 1991), noisy sorting (Shah and Wainwr...
详细信息
Coping with noise in computing is an important problem to consider in large systems. With applications in fault tolerance (Hastad et al., 1987;Pease et al., 1980;Pippenger et al., 1991), noisy sorting (Shah and Wainwright, 2018;Agarwal et al., 2017;Falahatgar et al., 2017;Heckel et al., 2019;Wang et al., 2024a;Gu and Xu, 2023;Kunisky et al., 2024), noisy searching (Berlekamp, 1964;Horstein, 1963;Burnashev and Zigangirov, 1974;Pelc, 1989;Karp and Kleinberg, 2007), among many others, the goal is to devise algorithms with the minimum number of queries that are robust enough to detect and correct the errors that can happen during the computation. In this work, we consider the noisy computing of the threshold-k function. For n Boolean variables x = (x1, ..., xn) ∈ {0, 1}n, the threshold-k function THk(·) computes whether the number of 1's in x is at least k or not, i.e., (Equation presented) The noisy queries correspond to noisy readings of the bits, where at each time step, the agent queries one of the bits, and with probability p, the wrong value of the bit is returned. It is assumed that the constant p ∈ (0, 1/2) is known to the agent. Our goal is to characterize the optimal query complexity for computing the THk function with error probability at most δ. This model for noisy computation of the THk function has been studied by Feige et al. (1994), where the order of the optimal query complexity is established;however, the exact tight characterization of the optimal number of queries is still open. In this paper, our main contribution is tightening this gap by providing new upper and lower bounds for the computation of the THk function, which simultaneously improve the existing upper and lower bounds. The main result of this paper can be stated as follows: for any 1 ≤ k ≤ n, there exists an algorithm that computes the THk function with an error probability at most δ = o(1), and the algorithm uses at most (Equation presented) queries in expectation. Here we define m (Eq
Image tampering detection and localization have emerged as a critical domain in combating the pervasive issue of image manipulation due to the advancement of the large-scale availability of sophisticated image editing...
详细信息
Image tampering detection and localization have emerged as a critical domain in combating the pervasive issue of image manipulation due to the advancement of the large-scale availability of sophisticated image editing *** manual forgery localization is often reliant on forensic *** recent times,machine learning(ML)and deep learning(DL)have shown promising results in automating image forgery ***,the ML-based method relies on hand-crafted ***,the DL method automatically extracts shallow spatial features to enhance the ***,DL-based methods lack the global co-relation of the features due to this performance degradation noticed in several *** the proposed study,we designed FLTNet(forgery localization transformer network)with a CNN(convolution neural network)encoder and transformer-based *** encoder extracts local high-dimensional features,and the transformer provides the global co-relation of the *** the decoder,we have exclusively utilized a CNN to upsample the features that generate tampered mask ***,we evaluated visual and quantitative performance on three standard datasets and comparison with six state-of-the-art *** IoU values of the proposed method on CASIA V1,CASIA V2,and CoMoFoD datasets are 0.77,0.82,and 0.84,*** addition,the F1-scores of these three datasets are 0.80,0.84,and 0.86,***,the visual results of the proposed method are clean and contain rich information,which can be used for real-time forgery *** code used in the study can be accessed through URL:https://***/ajit2k5/Forgery-Localization(accessed on 21 January 2025).
In the realm of deep learning, the prevalence of models with large number of parameters poses a significant challenge for low computation device. Critical influence of model size, primarily governed by weight paramete...
详细信息
Domain Name System (DNS) protocol is highly targeted nowadays for creating tunnels and extracting information from the intended machines. The reason for such exploitation is that DNS is passed unchecked by most firewa...
详细信息
During the early stages of software development, monolithic architectures predominated within software systems. However, their limitations in effectively accommodating dynamic user demands prompted the widespread adop...
详细信息
In this paper,a robust and consistent COVID-19 emergency decision-making approach is proposed based on q-rung linear diophantine fuzzy set(q-RLDFS),differential evolutionary(DE)optimization principles,and evidential r...
详细信息
In this paper,a robust and consistent COVID-19 emergency decision-making approach is proposed based on q-rung linear diophantine fuzzy set(q-RLDFS),differential evolutionary(DE)optimization principles,and evidential reasoning(ER)*** proposed approach uses q-RLDFS in order to represent the evaluating values of the alternatives corresponding to the *** optimization is used to obtain the optimal weights of the attributes,and ER methodology is used to compute the aggregated q-rung linear diophantine fuzzy values(q-RLDFVs)of each *** the score values of alternatives are computed based on the aggregated *** alternative with the maximum score value is selected as a better *** applicability of the proposed approach has been illustrated in COVID-19 emergency decision-making system and sustainable energy planning ***,we have validated the proposed approach with a numerical ***,a comparative study is provided with the existing models,where the proposed approach is found to be robust to perform better and consistent in uncertain environments.
Brain tumors are ranked highly among the leading causes of cancer-related fatalities. Precise segmentation and quantitative assessment of brain tumors are crucial for effective diagnosis and treatment planning. Howeve...
详细信息
To generate dance that temporally and aesthetically matches the music is a challenging problem in three ***,the generated motion should be beats-aligned to the local musical ***,the global aesthetic style should be ma...
详细信息
To generate dance that temporally and aesthetically matches the music is a challenging problem in three ***,the generated motion should be beats-aligned to the local musical ***,the global aesthetic style should be matched between motion and *** third,the generated motion should be diverse and *** address these challenges,we propose ReChoreoNet,which re-choreographs high-quality dance motion for a given piece of music.A data-driven learning strategy is proposed to efficiently correlate the temporal connections between music and motion in a progressively learned cross-modality embedding *** beats-aligned content motion will be subsequently used as autoregressive context and control signal to control a normalizing-flow model,which transfers the style of a prototype motion to the final generated *** addition,we present an aesthetically labelled music-dance repertoire(MDR)for both efficient learning of the cross-modality embedding,and understanding of the aesthetic connections between music and *** demonstrate that our repertoire-based framework is robustly extensible in both content and *** quantitative and qualitative experiments have been carried out to validate the efficiency of our proposed model.
暂无评论