Existing speech retrieval systems are frequently confronted with expanding volumes of speech data.The dynamic updating strategy applied to construct the index can timely process to add or remove unnecessary speech dat...Existing speech retrieval systems are frequently confronted with expanding volumes of speech data.The dynamic updating strategy applied to construct the index can timely process to add or remove unnecessary speech data to meet users’real-time retrieval requirements.This study proposes an efficient method for retrieving encryption speech,using unsupervised deep hashing and B+ tree dynamic index,which avoid privacy leak-age of speech data and enhance the accuracy and efficiency of retrieval.The cloud’s encryption speech library is constructed by using the multi-threaded Dijk-Gentry-Halevi-Vaikuntanathan(DGHV)Fully Homomorphic Encryption(FHE)technique,which encrypts the original speech.In addition,this research employs Residual Neural Network18-Gated Recurrent Unit(ResNet18-GRU),which is used to learn the compact binary hash codes,store binary hash codes in the designed B+tree index table,and create a mapping relation of one to one between the binary hash codes and the corresponding encrypted speech.External B+tree index technology is applied to achieve dynamic index updating of the B+tree index table,thereby satisfying users’needs for real-time retrieval.The experimental results on THCHS-30 and TIMIT showed that the retrieval accuracy of the proposed method is more than 95.84%compared to the existing unsupervised hashing methods.The retrieval efficiency is greatly improved.Compared to the method of using hash index tables,and the speech data’s security is effectively guaranteed.展开更多
Data security is a significant issue in cloud storage systems. After outsourcing data to cloud servers, clients lose physical control over the data. To guarantee clients that their data is intact on the server side, s...Data security is a significant issue in cloud storage systems. After outsourcing data to cloud servers, clients lose physical control over the data. To guarantee clients that their data is intact on the server side, some mechanism is needed for clients to periodically check the integrity of their data. Proof of retrievability （PoR） is designed to ensure data integrity. However, most prior PoR schemes focus on static data, and existing dynamic PoR is inefficient. In this paper, we propose a new version of dynamic PoR that is based on a B＋ tree and a Merkle hash tree. We propose a novel authenticated data structure, called Cloud Merkle B＋ tree （CMBT）. By combining CMBT with the BES signature, dynamic operations such as insertion, deletion, and modification are supported. Compared with existing PoR schemes, our scheme improves worst-case overhead from O（n） to O（log n）.展开更多
The emerging non-volatile memory(NVM)possesses DRAM-like performance and disk-like persistency,driving a trend of building single-level storage systems by replacing DRAM and disks.Using NVM as the universal main memor...The emerging non-volatile memory(NVM)possesses DRAM-like performance and disk-like persistency,driving a trend of building single-level storage systems by replacing DRAM and disks.Using NVM as the universal main memory brings opportunities and challenges to the design of new persistent in-memory data structures.In this context,several prior works have designed consistent and persistent B+trees on NVM.However,All of them evaluate performance of B+trees by applying an NVM performance simulator and can not provide concrete guidance on how to develop B+trees with good performance on NVM.In this paper,by using Optane DCs,we aim to study and analyze the influence factors of designing B+trees on NVM through a series of experiments and provide guidance on how to design efficient B+trees on NVM.According to our experiments and analysis,we draw several conclusions which are either not presented in prior works,or contrary to current ideas.We discover that the performance of B+trees is greatly affected by data formats.For example,we analyze the software layer optimizations and hardware layer optimizations separately and find that software layer optimizations do not always improve performance.Furthermore,B+trees place multiple entries on one node and the shift and balance overhead of FPTree accounts for 39%of the total overhead.展开更多
On the basis of the successful establishment of an animal model in tree shrews experimentally in fected with human hepatitis B virus (HHBV), a study on the hepatocarcinogenic effects of HHBV and aflatoxin B1 (AFB1) by...On the basis of the successful establishment of an animal model in tree shrews experimentally in fected with human hepatitis B virus (HHBV), a study on the hepatocarcinogenic effects of HHBV and aflatoxin B1 (AFB1) by using this animal model was conducted through a lifelong experiment. Among 41 tree shrews exposed to AFB1, 17 were experimentally infected by HHBV and 24 were uninfected. After 158 weeks, significant difference of primary liver cancer (PLC) incidence was present between the HHBV infected (52.94%) and uninfected (12.5%) groups (p<0.05). No difference was found between these two groups in the amount of AFB4 ingestion. Moreover, 1/9 of the tree shrews infected only by HHBV but not exposed to AFB4 developed PLC. No PLC was found in 6 tree shrews that had neither been infected with HHBV nor been exposed to AFB4. These results suggest the possible etiologic relationship between HHBV infection and PLC, as well as the synergetic effects of HHBV and AFB4 during PLC development.展开更多
In the current data-intensive landscape, B+trees are crucial data structures utilized across various fields like databases andweb indexing. With the rise of data explosion, the demand for high-performance real-time qu...In the current data-intensive landscape, B+trees are crucial data structures utilized across various fields like databases andweb indexing. With the rise of data explosion, the demand for high-performance real-time query processing in databasesystems has surged. For instance, Alibaba’s PolarDB and AnalyticDB systems handle massive query volumes and real-timedata processing, highlighting the need for efficient solutions. Traditional approaches leveraging GPUs for B+tree performanceenhancement have yielded positive results but suffer from high energy consumption, making their widespread deploymentin large data centers impractical. This paper introduces GreenB+Tree, an energy-efficient B+tree optimized for the PEZYSC3schip, known for its high energy efficiency and MIMD architecture, which mitigates common GPU memory and warpdivergence issues. GreenB+Tree innovatively transforms the B+tree structure into two one-dimensional arrays, significantlyreducing memory costs and computational overhead. It further incorporates query-agglomerated optimization (QAO) and thepersistent data residency strategy (PDRS) to minimize global memory access and enhance cache efficiency. Experimentalevaluations demonstrate that GreenB+Tree achieves a throughput of 62.6 Million Queries Per Second per Watt (MQPS/W),outperforming contemporary GPU-based solutions by approximately 4.5 times.展开更多
Objective: To assess the efficacy of Yanggan Aoping Mixture (养肝澳平, YGAPM) in treatinghepatitis B. Methods: Patients suffered from chronic hepatitis B were treated with YGAPM. Observe theirshort-- and long--term ef...Objective: To assess the efficacy of Yanggan Aoping Mixture (养肝澳平, YGAPM) in treatinghepatitis B. Methods: Patients suffered from chronic hepatitis B were treated with YGAPM. Observe theirshort-- and long--term efficacy and the change of serum hepatitis B virus marker. In experiment, the effects ofYGAPM in treating rat's liver injury as well as HBV--infected tree shrew and duck HBV--infected ducks were observed. Results: In 79 cases of chronic persistent hepatitis, the markedly effective rate was 60. 76%, and further raised to 70. 00 % in follow-up study in 40 cases. In 73 cases of chronic active hepatitis, the markedly effective rate was 60. 27%, and further raised to 62. 50% in 32 follow-up cases. In the treatment group, 85 of the119 cases (71. 43 % ) with HBeAg-positive were converted to negative. Whereas in the control group, only 40 of89 HBeAg-positive cases (44. 94 % ) were converted to negative, P < 0. 01. Results of experimental studyshowed that negative conversion rate of tree shrew infected with HBV marker was raised, while the duck HBVDNA in infected duck blood was inhibited. Those compared with the control group separately, the differencewas markedly significant. Conclusion: YGAPM is an effective drug in treating chronic hepatitis B, and it couldeffectively convert the marker to negative.展开更多
基金supported by the NationalNatural Science Foundation of China(No.61862041).
文摘Existing speech retrieval systems are frequently confronted with expanding volumes of speech data.The dynamic updating strategy applied to construct the index can timely process to add or remove unnecessary speech data to meet users’real-time retrieval requirements.This study proposes an efficient method for retrieving encryption speech,using unsupervised deep hashing and B+ tree dynamic index,which avoid privacy leak-age of speech data and enhance the accuracy and efficiency of retrieval.The cloud’s encryption speech library is constructed by using the multi-threaded Dijk-Gentry-Halevi-Vaikuntanathan(DGHV)Fully Homomorphic Encryption(FHE)technique,which encrypts the original speech.In addition,this research employs Residual Neural Network18-Gated Recurrent Unit(ResNet18-GRU),which is used to learn the compact binary hash codes,store binary hash codes in the designed B+tree index table,and create a mapping relation of one to one between the binary hash codes and the corresponding encrypted speech.External B+tree index technology is applied to achieve dynamic index updating of the B+tree index table,thereby satisfying users’needs for real-time retrieval.The experimental results on THCHS-30 and TIMIT showed that the retrieval accuracy of the proposed method is more than 95.84%compared to the existing unsupervised hashing methods.The retrieval efficiency is greatly improved.Compared to the method of using hash index tables,and the speech data’s security is effectively guaranteed.
基金supported in part by the US National Science Foundation under grant CNS-1115548 and a grant from Cisco Research
文摘Data security is a significant issue in cloud storage systems. After outsourcing data to cloud servers, clients lose physical control over the data. To guarantee clients that their data is intact on the server side, some mechanism is needed for clients to periodically check the integrity of their data. Proof of retrievability （PoR） is designed to ensure data integrity. However, most prior PoR schemes focus on static data, and existing dynamic PoR is inefficient. In this paper, we propose a new version of dynamic PoR that is based on a B＋ tree and a Merkle hash tree. We propose a novel authenticated data structure, called Cloud Merkle B＋ tree （CMBT）. By combining CMBT with the BES signature, dynamic operations such as insertion, deletion, and modification are supported. Compared with existing PoR schemes, our scheme improves worst-case overhead from O（n） to O（log n）.
基金supported by National Key Research&Development Program of China(Grant No.2018YFB1003301)the National Natural Science Foundation of China(Grant No.61832011)+1 种基金Huawei Innovation Research Program(Grant No.20202000097)HE’s research at Temple University is partially supported by the U.S.NSF grant CCF-1717660.
文摘The emerging non-volatile memory(NVM)possesses DRAM-like performance and disk-like persistency,driving a trend of building single-level storage systems by replacing DRAM and disks.Using NVM as the universal main memory brings opportunities and challenges to the design of new persistent in-memory data structures.In this context,several prior works have designed consistent and persistent B+trees on NVM.However,All of them evaluate performance of B+trees by applying an NVM performance simulator and can not provide concrete guidance on how to develop B+trees with good performance on NVM.In this paper,by using Optane DCs,we aim to study and analyze the influence factors of designing B+trees on NVM through a series of experiments and provide guidance on how to design efficient B+trees on NVM.According to our experiments and analysis,we draw several conclusions which are either not presented in prior works,or contrary to current ideas.We discover that the performance of B+trees is greatly affected by data formats.For example,we analyze the software layer optimizations and hardware layer optimizations separately and find that software layer optimizations do not always improve performance.Furthermore,B+trees place multiple entries on one node and the shift and balance overhead of FPTree accounts for 39%of the total overhead.
文摘On the basis of the successful establishment of an animal model in tree shrews experimentally in fected with human hepatitis B virus (HHBV), a study on the hepatocarcinogenic effects of HHBV and aflatoxin B1 (AFB1) by using this animal model was conducted through a lifelong experiment. Among 41 tree shrews exposed to AFB1, 17 were experimentally infected by HHBV and 24 were uninfected. After 158 weeks, significant difference of primary liver cancer (PLC) incidence was present between the HHBV infected (52.94%) and uninfected (12.5%) groups (p<0.05). No difference was found between these two groups in the amount of AFB4 ingestion. Moreover, 1/9 of the tree shrews infected only by HHBV but not exposed to AFB4 developed PLC. No PLC was found in 6 tree shrews that had neither been infected with HHBV nor been exposed to AFB4. These results suggest the possible etiologic relationship between HHBV infection and PLC, as well as the synergetic effects of HHBV and AFB4 during PLC development.
基金supported by the National Key Research and Development Program of China(No.2023YFA1011704,No.2021YFB0300101).
文摘In the current data-intensive landscape, B+trees are crucial data structures utilized across various fields like databases andweb indexing. With the rise of data explosion, the demand for high-performance real-time query processing in databasesystems has surged. For instance, Alibaba’s PolarDB and AnalyticDB systems handle massive query volumes and real-timedata processing, highlighting the need for efficient solutions. Traditional approaches leveraging GPUs for B+tree performanceenhancement have yielded positive results but suffer from high energy consumption, making their widespread deploymentin large data centers impractical. This paper introduces GreenB+Tree, an energy-efficient B+tree optimized for the PEZYSC3schip, known for its high energy efficiency and MIMD architecture, which mitigates common GPU memory and warpdivergence issues. GreenB+Tree innovatively transforms the B+tree structure into two one-dimensional arrays, significantlyreducing memory costs and computational overhead. It further incorporates query-agglomerated optimization (QAO) and thepersistent data residency strategy (PDRS) to minimize global memory access and enhance cache efficiency. Experimentalevaluations demonstrate that GreenB+Tree achieves a throughput of 62.6 Million Queries Per Second per Watt (MQPS/W),outperforming contemporary GPU-based solutions by approximately 4.5 times.
文摘Objective: To assess the efficacy of Yanggan Aoping Mixture (养肝澳平, YGAPM) in treatinghepatitis B. Methods: Patients suffered from chronic hepatitis B were treated with YGAPM. Observe theirshort-- and long--term efficacy and the change of serum hepatitis B virus marker. In experiment, the effects ofYGAPM in treating rat's liver injury as well as HBV--infected tree shrew and duck HBV--infected ducks were observed. Results: In 79 cases of chronic persistent hepatitis, the markedly effective rate was 60. 76%, and further raised to 70. 00 % in follow-up study in 40 cases. In 73 cases of chronic active hepatitis, the markedly effective rate was 60. 27%, and further raised to 62. 50% in 32 follow-up cases. In the treatment group, 85 of the119 cases (71. 43 % ) with HBeAg-positive were converted to negative. Whereas in the control group, only 40 of89 HBeAg-positive cases (44. 94 % ) were converted to negative, P < 0. 01. Results of experimental studyshowed that negative conversion rate of tree shrew infected with HBV marker was raised, while the duck HBVDNA in infected duck blood was inhibited. Those compared with the control group separately, the differencewas markedly significant. Conclusion: YGAPM is an effective drug in treating chronic hepatitis B, and it couldeffectively convert the marker to negative.
