P-stereogenic compounds play pivotal roles in natural products,pharmaceuticals,bioactive molecules,and catalysts/ligands,making their synthesis a highly researched area.Current studies have predominantly concentrated ...P-stereogenic compounds play pivotal roles in natural products,pharmaceuticals,bioactive molecules,and catalysts/ligands,making their synthesis a highly researched area.Current studies have predominantly concentrated on fully carbon-substituted P-stereogenic species,despite the fact that many therapeutically relevant compounds feature P-O,P-N,or P-S bonds.The catalytic and stereoselective nucleophilic substitution at the P-center is acknowledged as a highly efficient and straightforward approach for constructing high-value P-stereogenic compounds,offering significant potential for further development.This review provides an overview of advancements in the construction of P-stereogenic centers based on Pcentered nucleophilic substitution,highlighting key challenges,breakthroughs,and future opportunities in the field.展开更多
The p-center problem consists of choosing a subset of vertices in an undirected graph as facilities in order to minimize the maximum distance between a client and its closest facility. This paper presents a greedy ran...The p-center problem consists of choosing a subset of vertices in an undirected graph as facilities in order to minimize the maximum distance between a client and its closest facility. This paper presents a greedy randomized adaptive search procedure with path-relinking （GRASP/PR） algorithm for the p-center problem, which combines both GRASP and path-relinking. Each iteration of GRASP/PR consists of the construction of a randomized greedy solution, followed by a tabu search procedure. The resulting solution is combined with one of the elite solutions by path-relinking, which consists in exploring trajectories that connect high-quality solutions. Experiments show that GRASP/PR is competitive with the state-of-the-art algorithms in the literature in terms of both solution quality and computational efficiency. Specifically, it virtually improves the previous best known results for 10 out of 40 large instances while matching the best known results for others.展开更多
文章研究并解决数据中心的远程内存直接读取(remote direct memory access, RDMA)技术的网络拥塞控制问题。针对主流拥塞控制算法数据中心量化拥塞通知(data center quantized congestion notification, DCQCN)的收敛速度慢和缺乏硬件...文章研究并解决数据中心的远程内存直接读取(remote direct memory access, RDMA)技术的网络拥塞控制问题。针对主流拥塞控制算法数据中心量化拥塞通知(data center quantized congestion notification, DCQCN)的收敛速度慢和缺乏硬件实现方案的不足,提出可参数硬件化的数据中心量化拥塞通知(parameterized DCQCN,DCQCN-p)算法,该算法通过优化拥塞流的速度因子a、g调整速度比例Rc,并通过电路设计减少降速的频次;通过建立算法模型和搭建网络仿真NS-3平台,对比DCQCN-p算法在面临拥塞时单个调度流速度调整的性能以及多个调度流并发情况下的时延和吞吐量。仿真结果表明:在单个流面临拥塞时,DCQCN-p算法的数据传输速率比DCQCN算法的提高了50%;DCQCN-p算法在链路上最小速率为13.28 Gbit/s,相较于DCQCN、TIMELY、数据中心传输控制协议(data center transmission control protocol, DCTCP)算法,分别增长了24%、48%、23%;DCQCN-p算法(方差65%)的带宽分配公平性相较于TIMELY算法(方差216%)和DCTCP算法(方差191%)表现出显著的性能提升。展开更多
基金financial support from the National Natural Science Foundation of China(Nos.22171187 and 22001173)the Project of Department of Education of Guangdong Province(No.2020KTSCX116)+3 种基金the Shenzhen Science and Technology Foundation(Nos.20200812202943001 and KQJSCX20180328100401788)Frontiers Science Center for Asymmetric Synthesis and Medicinal Molecules,Department of Education,Guizhou Province(No.Qianjiaohe KY(2020)004)the Central Government Guides Local Science and Technology Development Fund Projects(Nos.Qiankehezhongyindi(2024)007,(2023)001)Singapore National Research Foundation under its NRF Competitive Research Program(No.NRFCRP22–2019–0002)。
文摘P-stereogenic compounds play pivotal roles in natural products,pharmaceuticals,bioactive molecules,and catalysts/ligands,making their synthesis a highly researched area.Current studies have predominantly concentrated on fully carbon-substituted P-stereogenic species,despite the fact that many therapeutically relevant compounds feature P-O,P-N,or P-S bonds.The catalytic and stereoselective nucleophilic substitution at the P-center is acknowledged as a highly efficient and straightforward approach for constructing high-value P-stereogenic compounds,offering significant potential for further development.This review provides an overview of advancements in the construction of P-stereogenic centers based on Pcentered nucleophilic substitution,highlighting key challenges,breakthroughs,and future opportunities in the field.
基金The research was supported by the National Natural Science Foundation of China under Grant Nos. 61370183 and 61262011.
文摘The p-center problem consists of choosing a subset of vertices in an undirected graph as facilities in order to minimize the maximum distance between a client and its closest facility. This paper presents a greedy randomized adaptive search procedure with path-relinking （GRASP/PR） algorithm for the p-center problem, which combines both GRASP and path-relinking. Each iteration of GRASP/PR consists of the construction of a randomized greedy solution, followed by a tabu search procedure. The resulting solution is combined with one of the elite solutions by path-relinking, which consists in exploring trajectories that connect high-quality solutions. Experiments show that GRASP/PR is competitive with the state-of-the-art algorithms in the literature in terms of both solution quality and computational efficiency. Specifically, it virtually improves the previous best known results for 10 out of 40 large instances while matching the best known results for others.
文摘文章研究并解决数据中心的远程内存直接读取(remote direct memory access, RDMA)技术的网络拥塞控制问题。针对主流拥塞控制算法数据中心量化拥塞通知(data center quantized congestion notification, DCQCN)的收敛速度慢和缺乏硬件实现方案的不足,提出可参数硬件化的数据中心量化拥塞通知(parameterized DCQCN,DCQCN-p)算法,该算法通过优化拥塞流的速度因子a、g调整速度比例Rc,并通过电路设计减少降速的频次;通过建立算法模型和搭建网络仿真NS-3平台,对比DCQCN-p算法在面临拥塞时单个调度流速度调整的性能以及多个调度流并发情况下的时延和吞吐量。仿真结果表明:在单个流面临拥塞时,DCQCN-p算法的数据传输速率比DCQCN算法的提高了50%;DCQCN-p算法在链路上最小速率为13.28 Gbit/s,相较于DCQCN、TIMELY、数据中心传输控制协议(data center transmission control protocol, DCTCP)算法,分别增长了24%、48%、23%;DCQCN-p算法(方差65%)的带宽分配公平性相较于TIMELY算法(方差216%)和DCTCP算法(方差191%)表现出显著的性能提升。
