Using quantum algorithms to solve various problems has attracted widespread attention with the development of quantum computing.Researchers are particularly interested in using the acceleration properties of quantum a...Using quantum algorithms to solve various problems has attracted widespread attention with the development of quantum computing.Researchers are particularly interested in using the acceleration properties of quantum algorithms to solve NP-complete problems.This paper focuses on the well-known NP-complete problem of finding the minimum dominating set in undirected graphs.To expedite the search process,a quantum algorithm employing Grover’s search is proposed.However,a challenge arises from the unknown number of solutions for the minimum dominating set,rendering direct usage of original Grover’s search impossible.Thus,a swap test method is introduced to ascertain the number of iterations required.The oracle,diffusion operators,and swap test are designed with achievable quantum gates.The query complexity is O(1.414^(n))and the space complexity is O(n).To validate the proposed approach,qiskit software package is employed to simulate the quantum circuit,yielding the anticipated results.展开更多
BACKGROUND Equations for estimation glomerular filtration rate(eGFR)have been associated with poor clinical performance and their clinical accuracy and reliability have been called into question.AIM To assess the long...BACKGROUND Equations for estimation glomerular filtration rate(eGFR)have been associated with poor clinical performance and their clinical accuracy and reliability have been called into question.AIM To assess the longitudinal changes in measured glomerular filtration rate(mGFR)in patients with autosomal dominant polycystic kidney disease(ADPKD).METHODS Analysis of an ambispective data base conducted on consecutive patients diagnosed with ADPKD.The mGFR was assessed by iohexol clearance;while eGFR was calculated by three different formulas:(1)The chronic kidney disease epidemiology collaboration(CKD-EPI);(2)Modification of diet in renal disease(MDRD);and(3)The 24-hour urine creatinine clearance(CrCl).The primary end-points were the mean change in mGFR between the baseline and final visit,as well as the comparison of the mean change in mGFR with the change estimated by the different formulas.RESULTS Thirty-seven patients were included in the study.As compared to baseline,month-6 mGFR was significantly decrease by-4.4 mL/minute±10.3 mL/minute(P=0.0132).However,the CKD-EPI,MDRD,and CrCl formulas underestimated this change by 48.3%,89.0%,and 45.8%respectively,though none of these differences reached statistical significance(P=0.3647;P=0.0505;and P=0.736,respectively).The discrepancies between measured and estimated glomerular filtration rate values,as evaluated by CKD-EPI(r=0.29,P=0.086);MDRD(r=0.19,P=0.272);and CrCl(r=0.09,P=0.683),were not correlated with baseline mGFR values.CONCLUSION This study indicated that eGFR inaccurately reflects the decline in mGFR and cannot reliably track changes over time.This poses significant challenges for clinical decision-making,particularly in treatment strategies.展开更多
To cope with the constraint problem of power consumption and transmission delay in the virtual backbone of wireless sensor network, a distributed connected dominating set （CDS） algorithm with （α,β）-constraints i...To cope with the constraint problem of power consumption and transmission delay in the virtual backbone of wireless sensor network, a distributed connected dominating set （CDS） algorithm with （α,β）-constraints is proposed. Based on the （α, β）-tree concept, a new connected dominating tree with bounded transmission delay problem（CDTT） is defined and a corresponding algorithm is designed to construct a CDT-tree which can trade off limited total power and bounded transmission delay from source to destination nodes. The CDT algorithm consists of two phases： The first phase constructs a maximum independent set（MIS）in a unit disk graph model. The second phase estimates the distance and calculates the transmission power to construct a spanning tree in an undirected graph with different weights for MST and SPF, respectively. The theoretical analysis and simulation results show that the CDT algorithm gives a correct solution to the CDTF problem and forms a virtual backbone with（ α,β）-constraints balancing the requirements of power consumption and transmission delay.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant No.62101600)the Science Foundation of China University of Petroleum,Beijing(Grant No.2462021YJRC008)the State Key Laboratory of Cryptology(Grant No.MMKFKT202109).
文摘Using quantum algorithms to solve various problems has attracted widespread attention with the development of quantum computing.Researchers are particularly interested in using the acceleration properties of quantum algorithms to solve NP-complete problems.This paper focuses on the well-known NP-complete problem of finding the minimum dominating set in undirected graphs.To expedite the search process,a quantum algorithm employing Grover’s search is proposed.However,a challenge arises from the unknown number of solutions for the minimum dominating set,rendering direct usage of original Grover’s search impossible.Thus,a swap test method is introduced to ascertain the number of iterations required.The oracle,diffusion operators,and swap test are designed with achievable quantum gates.The query complexity is O(1.414^(n))and the space complexity is O(n).To validate the proposed approach,qiskit software package is employed to simulate the quantum circuit,yielding the anticipated results.
文摘BACKGROUND Equations for estimation glomerular filtration rate(eGFR)have been associated with poor clinical performance and their clinical accuracy and reliability have been called into question.AIM To assess the longitudinal changes in measured glomerular filtration rate(mGFR)in patients with autosomal dominant polycystic kidney disease(ADPKD).METHODS Analysis of an ambispective data base conducted on consecutive patients diagnosed with ADPKD.The mGFR was assessed by iohexol clearance;while eGFR was calculated by three different formulas:(1)The chronic kidney disease epidemiology collaboration(CKD-EPI);(2)Modification of diet in renal disease(MDRD);and(3)The 24-hour urine creatinine clearance(CrCl).The primary end-points were the mean change in mGFR between the baseline and final visit,as well as the comparison of the mean change in mGFR with the change estimated by the different formulas.RESULTS Thirty-seven patients were included in the study.As compared to baseline,month-6 mGFR was significantly decrease by-4.4 mL/minute±10.3 mL/minute(P=0.0132).However,the CKD-EPI,MDRD,and CrCl formulas underestimated this change by 48.3%,89.0%,and 45.8%respectively,though none of these differences reached statistical significance(P=0.3647;P=0.0505;and P=0.736,respectively).The discrepancies between measured and estimated glomerular filtration rate values,as evaluated by CKD-EPI(r=0.29,P=0.086);MDRD(r=0.19,P=0.272);and CrCl(r=0.09,P=0.683),were not correlated with baseline mGFR values.CONCLUSION This study indicated that eGFR inaccurately reflects the decline in mGFR and cannot reliably track changes over time.This poses significant challenges for clinical decision-making,particularly in treatment strategies.
基金Major Program of the National Natural Science Foundation of China (No.70533050)High Technology Research Program ofJiangsu Province(No.BG2007012)+1 种基金China Postdoctoral Science Foundation(No.20070411065)Science Foundation of China University of Mining andTechnology(No.OC080303)
文摘To cope with the constraint problem of power consumption and transmission delay in the virtual backbone of wireless sensor network, a distributed connected dominating set （CDS） algorithm with （α,β）-constraints is proposed. Based on the （α, β）-tree concept, a new connected dominating tree with bounded transmission delay problem（CDTT） is defined and a corresponding algorithm is designed to construct a CDT-tree which can trade off limited total power and bounded transmission delay from source to destination nodes. The CDT algorithm consists of two phases： The first phase constructs a maximum independent set（MIS）in a unit disk graph model. The second phase estimates the distance and calculates the transmission power to construct a spanning tree in an undirected graph with different weights for MST and SPF, respectively. The theoretical analysis and simulation results show that the CDT algorithm gives a correct solution to the CDTF problem and forms a virtual backbone with（ α,β）-constraints balancing the requirements of power consumption and transmission delay.
