Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
IoT network slicing on virtual layers of homogeneous data for improved algorithm operation in smart buildings
With its strong coverage, low energy consumption, low cost and great connectivity, the
Internet of Things technology has become the key technology in smart cities. However, faced …
Internet of Things technology has become the key technology in smart cities. However, faced …
PeGraph: A system for privacy-preserving and efficient search over encrypted social graphs
With the widespread adoption of cloud computing, it is increasingly popular for online social
network (OSN) service providers to leverage the public cloud as a back-end to manage their …
network (OSN) service providers to leverage the public cloud as a back-end to manage their …
An efficient algorithm for graph edit distance computation
The graph edit distance (GED) is a well-established distance measure widely used in many
applications, such as bioinformatics, data mining, pattern recognition, and graph …
applications, such as bioinformatics, data mining, pattern recognition, and graph …
Efficient data persistence and data division for distributed computing in cloud data center networks
X Wang, X Hu, W Fan, R Wang - The Journal of Supercomputing, 2023 - Springer
Container-based Hadoop distributed file system (HDFS) storage has been widely used in
cloud data center networks, while traditional HDFS has single point problem resulting in …
cloud data center networks, while traditional HDFS has single point problem resulting in …
SecGraph: Towards SGX-based Efficient and Confidentiality-Preserving Graph Search
Graphs have more expressive power and are widely researched in various search demand
scenarios, compared with traditional relational and XML models. Today, many graph search …
scenarios, compared with traditional relational and XML models. Today, many graph search …
Practical high-order entropy-compressed text self-indexing
H Huo, P Long, JS Vitter - IEEE Transactions on Knowledge …, 2021 - ieeexplore.ieee.org
Compressed self-indexes are used widely in string processing applications, such as
information retrieval, genome analysis, data mining, and web searching. The index not only …
information retrieval, genome analysis, data mining, and web searching. The index not only …
Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions
Given a set of data graphs and a query graph, graph isomorphism query processing is the
problem of finding all the data graphs that are isomorphic to the query graph. Graph …
problem of finding all the data graphs that are isomorphic to the query graph. Graph …
Efficient compression and indexing for highly repetitive DNA sequence collections
In this paper, we focus upon the important problem of indexing and searching highly
repetitive DNA sequence collections. Given a collection of sequences of length each, we …
repetitive DNA sequence collections. Given a collection of sequences of length each, we …
CIndex: compressed indexes for fast retrieval of FASTQ files
H Huo, P Liu, C Wang, H Jiang, JS Vitter - Bioinformatics, 2022 - academic.oup.com
Motivation Ultrahigh-throughput next-generation sequencing instruments continue to
generate vast amounts of genomic data. These data are generally stored in FASTQ format …
generate vast amounts of genomic data. These data are generally stored in FASTQ format …
A Novel Two-Stage Directed Graph Similarity Determination Algorithm
Z Hongwei, H **aojie, K Zhipeng… - 2022 IEEE 4th …, 2022 - ieeexplore.ieee.org
Algorithms that can accurately determine the similarity of directed graphs often need a heavy
overhead. In order to save time and achieve a better balance between performance cost and …
overhead. In order to save time and achieve a better balance between performance cost and …