3篇
您的检索式：作者名="Yeting Guo"
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | miR-181b functions as an oncomiR in colorectal cancer by targeting PDCDZ显示文摘 | Yanqing Liu Uzair-ur-Rehman Yu Guo Hongwei Liang Rongjie Cheng Fei Yang Yeting Hong Chihao Zhao Minghui Liu Mengchao Yu Xinyan Zhou Kai Yin Jiangning Chen Junfeng Zhang Chen-Yu Zhang Feng Zhi Xi Chen | 2016 | Protein & Cell2016，7，10： | 14 |
| 2 | Trimetaphosphate-induced chiral selection between amino acid and nucleoside using ^(15)N-^(31)P coupling NMR显示文摘Life on Earth uses a common set of L-amino acids(L-aa)to construct proteins and D-nucleosides(D-Nu)to form nucleic acids,which serve as the carrier of genetic information.Herein,we reveal the in-trinsic mechanism of chiral selection of L-aa and D-Nu from the perspective of chemical origin of life.This work employed^(15)N-labeled L-aa and performed one-pot synthesis of nucleotide amidate of amino acid(N-aa-NMP)using equal amounts of L-^(15)N-aa and D-^(14)N-aa with D-/L-Nu in the aqueous solution of trimetaphosphate,generating L-^(15)N-aa-NMP and D-^(14)N-aa-NMP,respectively.The ^(31)P-NMR data indicated that L-aa was preferentially selected during the formation of N-aa-NMP in the presence of D-Nu.Surpris-ingly,D-aa was preferred over L-aa in the presence of L-Nu.Further analysis revealed that L-^(15)N-aa-D-NMP vs.D-^(14)N-aa-L-NMP and D-^(14)N-aa-D-NMP vs.L-^(15)N-aa-L-NMP were mirror isomers of each other,respec-tively.These data suggest that there could be a set of chiral systems opposite to that on Earth,which infers there might be a world of life that is a mirror image of the Earth. | Jianxi Ying Ruiwen Ding Yumeng Zhang Bowen Han Yeting Guo Ning Wang Dandan Guo Yile Wu Junwei Huang Yan Liu Feng Ni Shaohua Huang Yufen Zhao | 2022 | Chinese Chemical Letters2022，33，2： | 0 |
| 3 | Task-Based Resource Allocation Bid in Edge Computing Micro Datacenter显示文摘Edge computing attracts online service providers(SP)to offload services to edge computing micro datacenters that are close to end users.Such offloads reduce packet-loss rates,delays and delay jitter when responding to service requests.Simultaneously,edge computing resource providers(RP)are concerned with maximizing incomes by allocating limited resources to SPs.Most works on this topic make a simplified assumption that each SP has a fixed demand;however,in reality,SPs themselves may have multiple taskoffloading alternatives.Thus,their demands could be flexibly changed,which could support finer-grained allocations and further improve the incomes for RPs.Here,we propose a novel resource bidding mechanism for the RP in which each SP bids resources based on the demand of a single task(task-based)rather than the whole service(servicebased)and then the RP allocates resources to these tasks with following the resource constraints at edge servers and the sequential rule of task-offloading to guarantee the interest of SPs.We set the incomes of the RP as our optimization target and then formulate the resource allocation problem.Two typical greedy algorithms are adopted to solve this problem and analyze the performance differences using two different bidding methods.Comprehensive results show that our proposal optimizes resource utilization and improves the RP’s incomes when resources in the edge computing datacenter are limited. | Yeting Guo Fang Liu Nong Xiao Zhengguo Chen | 2019 | Computers, Materials & Continua2019，，8： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员