Matroid theory has been developed to be a mature branch of mathematics and has extensive applications in combinatorial optimization,algorithm design and so *** the other hand,quantum computing has attracted much atten...
详细信息
Matroid theory has been developed to be a mature branch of mathematics and has extensive applications in combinatorial optimization,algorithm design and so *** the other hand,quantum computing has attracted much attention and has been shown to surpass classical computing on solving some computational ***,crossover studies of the two fields seem to be missing in the *** paper initiates the study of quantum algorithms for matroid property *** is shown that quadratic quantum speedup is possible for the calculation problem of finding the girth or the number of circuits(bases,flats,hyperplanes)of a matroid,and for the decision problem of deciding whether a matroid is uniform or Eulerian,by giving a uniform lower boundΩ■on the query complexity of all these *** the other hand,for the uniform matroid decision problem,an asymptotically optimal quantum algorithm is proposed which achieves the lower bound,and for the girth problem,an almost optimal quantum algorithm is given with query complexityO■.In addition,for the paving matroid decision problem,a lower boundΩ■on the query complexity is obtained,and an O■ quantum algorithm is presented.
The present study advances object detection and tracking techniques by proposing a novel model combining Automated Image Annotation with Inception v2-based Faster RCNN (AIA-IFRCNN). The research methodology utilizes t...
详细信息
The increasing use of cloud-based image storage and retrieval systems has made ensuring security and efficiency crucial. The security enhancement of image retrieval and image archival in cloud computing has received c...
详细信息
The increasing use of cloud-based image storage and retrieval systems has made ensuring security and efficiency crucial. The security enhancement of image retrieval and image archival in cloud computing has received considerable attention in transmitting data and ensuring data confidentiality among cloud servers and users. Various traditional image retrieval techniques regarding security have developed in recent years but they do not apply to large-scale environments. This paper introduces a new approach called Triple network-based adaptive grey wolf (TN-AGW) to address these challenges. The TN-AGW framework combines the adaptability of the Grey Wolf Optimization (GWO) algorithm with the resilience of Triple Network (TN) to enhance image retrieval in cloud servers while maintaining robust security measures. By using adaptive mechanisms, TN-AGW dynamically adjusts its parameters to improve the efficiency of image retrieval processes, reducing latency and utilization of resources. However, the image retrieval process is efficiently performed by a triple network and the parameters employed in the network are optimized by Adaptive Grey Wolf (AGW) optimization. Imputation of missing values, Min–Max normalization, and Z-score standardization processes are used to preprocess the images. The image extraction process is undertaken by a modified convolutional neural network (MCNN) approach. Moreover, input images are taken from datasets such as the Landsat 8 dataset and the Moderate Resolution Imaging Spectroradiometer (MODIS) dataset is employed for image retrieval. Further, the performance such as accuracy, precision, recall, specificity, F1-score, and false alarm rate (FAR) is evaluated, the value of accuracy reaches 98.1%, the precision of 97.2%, recall of 96.1%, and specificity of 917.2% respectively. Also, the convergence speed is enhanced in this TN-AGW approach. Therefore, the proposed TN-AGW approach achieves greater efficiency in image retrieving than other existing
Container-based virtualization isbecoming increasingly popular in cloud computing due to its efficiency and *** isolation is a fundamental property of *** works have indicated weak resource isolation could cause signi...
详细信息
Container-based virtualization isbecoming increasingly popular in cloud computing due to its efficiency and *** isolation is a fundamental property of *** works have indicated weak resource isolation could cause significant performance degradation for containerized applications and enhanced resource ***,current studies have almost not discussed the isolation problems of page cache which is a key resource for *** leverage memory cgroup to control page cache ***,existing policy introduces two major problems in a container-based ***,containers can utilize more memory than limited by their cgroup,effectively breaking memory ***,the Os kernel has to evict page cache to make space for newly-arrived memory requests,slowing down containerized *** paper performs an empirical study of these problems and demonstrates the performance impacts on containerized *** we propose pCache(precise control of page cache)to address the problems by dividing page cache into private and shared and controlling both kinds of page cache separately and *** do so,pCache leverages two new technologies:fair account(f-account)and evict on demand(EoD).F-account splits the shared page cache charging based on per-container share to prevent containers from using memory for free,enhancing memory *** EoD reduces unnecessary page cache evictions to avoid the performance *** evaluation results demonstrate that our system can effectively enhance memory isolation for containers and achieve substantial performance improvement over the original page cache management policy.
Wearable biomechanical sensors can be placed on different body locations and each sensor may have multiple channels. Deep mining of the spatial variability in these sensor locations and channels, is essential for not ...
详细信息
Multifunctional behavioral antennas are one of the significant features of the modern wireless communication systems. This is due to the fact that the miniaturized sizes of the devices demand compact and low-profile a...
详细信息
We study lane changing in connected vehicles, in the presence of surrounding vehicles with non-uniform velocities, under unreliable communication. We adopt a dynamic trajectory tracking approach, wherein a subject veh...
详细信息
Music genre classification is one of the most interesting topics in digital music. Classifying genres is basically subjective, and different listeners may perceive genres in various ways. Furthermore, it might be diff...
详细信息
In this article,the secure computation efficiency(SCE)problem is studied in a massive multipleinput multiple-output(mMIMO)-assisted mobile edge computing(MEC)*** first derive the secure transmission rate based on the ...
详细信息
In this article,the secure computation efficiency(SCE)problem is studied in a massive multipleinput multiple-output(mMIMO)-assisted mobile edge computing(MEC)*** first derive the secure transmission rate based on the mMIMO under imperfect channel state *** on this,the SCE maximization problem is formulated by jointly optimizing the local computation frequency,the offloading time,the downloading time,the users and the base station transmit *** to its difficulty to directly solve the formulated problem,we first transform the fractional objective function into the subtractive form one via the dinkelbach ***,the original problem is transformed into a convex one by applying the successive convex approximation technique,and an iteration algorithm is proposed to obtain the ***,the stimulations are conducted to show that the performance of the proposed schemes is superior to that of the other schemes.
Reachability query plays a vital role in many graph analysis *** researches proposed many methods to efficiently answer reachability queries between vertex *** many real graphs are labeled graph,it highly demands Labe...
详细信息
Reachability query plays a vital role in many graph analysis *** researches proposed many methods to efficiently answer reachability queries between vertex *** many real graphs are labeled graph,it highly demands Label-Constrained Reachability(LCR)query inwhich constraint includes a set of labels besides vertex *** researches proposed several methods for answering some LCR queries which require appearance of some labels specified in constraints in the *** that constraint may be a label set,query constraint may be ordered labels,namely OLCR(Ordered-Label-Constrained Reachability)queries which retrieve paths matching a sequence of ***,no solutions are available for ***,we propose DHL,a novel bloom filter based indexing technique for answering OLCR *** can be used to check reachability between vertex *** the answers are not no,then constrained DFS is ***,we employ DHL followed by performing constrained DFS to answer OLCR *** show that DHL has a bounded false positive rate,and it's powerful in saving indexing time and *** experiments on 10 real-life graphs and 12 synthetic graphs demonstrate that DHL achieves about 4.8-22.5 times smaller index space and 4.6-114 times less index construction time than two state-of-art techniques for LCR queries,while achieving comparable query response *** results also show that our algorithm can answer OLCR queries effectively.
暂无评论