This study introduces an innovative approach to optimize cloud computing job distribution using the Improved Dynamic Johnson Sequencing Algorithm(DJS).Emphasizing on-demand resource sharing,typical to Cloud Service Pr...
详细信息
This study introduces an innovative approach to optimize cloud computing job distribution using the Improved Dynamic Johnson Sequencing Algorithm(DJS).Emphasizing on-demand resource sharing,typical to Cloud Service Providers(CSPs),the research focuses on minimizing job completion delays through efficient task *** Johnson’s rule from operations research,the study addresses the challenge of resource availability post-task *** advocates for queuing models with multiple servers and finite capacity to improve job scheduling models,subsequently reducing wait times and queue *** Dynamic Johnson Sequencing Algorithm and the M/M/c/K queuing model are applied to optimize task sequences,showcasing their efficacy through comparative *** research evaluates the impact of makespan calculation on data file transfer times and assesses vital performance indicators,ultimately positioning the proposed technique as superior to existing approaches,offering a robust framework for enhanced task scheduling and resource allocation in cloud computing.
The main requirement in the office sector is the administrative process. At the engineering faculty of the Islamic University of Makassar, some of the administrative processes have used technology to make it easier fo...
详细信息
Many Internet protocol (IP) lookup algorithms have been formulated to improve network performance. This study reviewed and experimentally evaluated technologies for trie-based methods that reduce memory access, memory...
详细信息
Support Vector Machine(SVM)has become one of the traditional machine learning algorithms the most used in prediction and classification ***,its behavior strongly depends on some parameters,making tuning these paramete...
详细信息
Support Vector Machine(SVM)has become one of the traditional machine learning algorithms the most used in prediction and classification ***,its behavior strongly depends on some parameters,making tuning these parameters a sensitive step to maintain a good *** the other hand,and as any other classifier,the performance of SVM is also affected by the input set of features used to build the learning model,which makes the selection of relevant features an important task not only to preserve a good classification accuracy but also to reduce the dimensionality of *** this paper,the MRFO+SVM algorithm is introduced by investigating the recent manta ray foraging optimizer to fine-tune the SVM parameters and identify the optimal feature subset *** proposed approach is validated and compared with four SVM-based algorithms over eight benchmarking ***,it is applied to a disease Covid-19 *** experimental results show the high ability of the proposed algorithm to find the appropriate SVM’s parameters,and its acceptable performance to deal with feature selection problem.
Camouflaged object detection is a challenging task that aims to identify objects that are highly similar to their background. Due to the powerful noise-to-image denoising capability of denoising diffusion models, in t...
详细信息
Millimeter-wave (mm-wave) and terahertz (THz) communication systems can satisfy the high data rate requirements in 5G, 6G, and beyond networks, but still rely on the use of extensive antenna arrays to guarantee suffic...
详细信息
IEEE 802.11ax defines a new channel access scheme of OFDMA-based random access (UORA) for varying number of associated stations (STAs) to send their requests or data to the access point (AP) in a contention manner. Th...
详细信息
In recent years, there has been significant research focusing on addressing security concerns in single-modal person re-identification (ReID) systems that are based on RGB images. However, the safety of cross-modality...
ISBN:
(纸本)9798331314385
In recent years, there has been significant research focusing on addressing security concerns in single-modal person re-identification (ReID) systems that are based on RGB images. However, the safety of cross-modality scenarios, which are more commonly encountered in practical applications involving images captured by infrared cameras, has not received adequate attention. The main challenge in cross-modality ReID lies in effectively dealing with visual differences between different modalities. For instance, infrared images are typically grayscale, unlike visible images that contain color information. Existing attack methods have primarily focused on the characteristics of the visible image modality, overlooking the features of other modalities and the variations in data distribution among different modalities. This oversight can potentially undermine the effectiveness of these methods in image retrieval across diverse modalities. This study represents the first exploration into the security of cross-modality ReID models and proposes a universal perturbation attack specifically designed for cross-modality ReID. This attack optimizes perturbations by leveraging gradients from diverse modality data, thereby disrupting the discriminator and reinforcing the differences between modalities. We conducted experiments on three widely used cross-modality datasets, namely RegDB, SYSU, and LLCM. The results not only demonstrate the effectiveness of our method but also provide insights for future improvements in the robustness of cross-modality ReID systems.
Valiant, in his seminal paper in 1979, showed an efficient simulation of algebraic formulas by determinants, showing that VF, the class of polynomial families computable by polynomial-sized algebraic formulas, is cont...
详细信息
ISBN:
(纸本)9783959772563
Valiant, in his seminal paper in 1979, showed an efficient simulation of algebraic formulas by determinants, showing that VF, the class of polynomial families computable by polynomial-sized algebraic formulas, is contained in VDet, the class of polynomial families computable by polynomialsized determinants. Whether this containment is strict has been a long-standing open problem. We show that algebraic formulas can in fact be efficiently simulated by the determinant of tetradiagonal matrices, transforming the open problem into a problem about determinant of general matrices versus determinant of tetradiagonal matrices with just three non-zero diagonals. This is also optimal in a sense that we cannot hope to get the same result for matrices with only two non-zero diagonals or even tridiagonal matrices, thanks to Allender and Wang (Computational Complexity'16) which showed that the determinant of tridiagonal matrices cannot even compute simple polynomials like x1x2 + x3x4 + + x15x16. Our proof involves a structural refinement of the simulation of algebraic formulas by width-3 algebraic branching programs by Ben-Or and Cleve (SIAM Journal of Computing'92). The tetradiagonal matrices we obtain in our proof are also structurally very similar to the tridiagonal matrices of Bringmann, Ikenmeyer and Zuiddam (JACM'18) which showed that, if we allow approximations in the sense of geometric complexity theory, algebraic formulas can be efficiently simulated by the determinant of tridiagonal matrices of a very special form, namely the continuant polynomial. The continuant polynomial family is closely related to the Fibonacci sequence, which was used to model the breeding of rabbits. The determinants of our tetradiagonal matrices, in comparison, is closely related to Narayana's cows sequences, which was originally used to model the breeding of cows. Our result shows that the need for approximation can be eliminated by using Narayana's cows polynomials instead of continuant polyno
Recently,smart cities have emerged as an effective approach to deliver high-quality services to the people through adaptive optimization of the available *** the advantages of smart cities,security remains a huge chal...
详细信息
Recently,smart cities have emerged as an effective approach to deliver high-quality services to the people through adaptive optimization of the available *** the advantages of smart cities,security remains a huge challenge to be ***,Intrusion Detection System(IDS)is the most proficient tool to accomplish security in this ***,blockchain exhibits significance in promoting smart city designing,due to its effective characteristics like immutability,transparency,and *** order to address the security problems in smart cities,the current study designs a Privacy Preserving Secure Framework using Blockchain with Optimal Deep Learning(PPSF-BODL)*** proposed PPSFBODL model includes the collection of primary data using sensing ***,z-score normalization is also utilized to transform the actual data into useful ***,Chameleon Swarm Optimization(CSO)with Attention Based Bidirectional Long Short TermMemory(ABiLSTM)model is employed for detection and classification of *** is employed for optimal hyperparameter tuning of ABiLSTM *** the same time,Blockchain(BC)is utilized for secure transmission of the data to cloud *** cloud server is a decentralized,distributed,and open digital ledger that is employed to store the transactions in different methods.A detailed experimentation of the proposed PPSF-BODL model was conducted on benchmark dataset and the outcomes established the supremacy of the proposed PPSFBODL model over recent approaches with a maximum accuracy of 97.46%.
暂无评论