期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
STUDY ON THE RFLPs AND AMPLICATION AND REARRANGEMENT OF THE TRANSFORMING GENES IN PRIMARY HEPATIC CARCINOMA, GASTRIC CARCINOMA AND BRAIN TUMOR WITH SIX HUMAN ONCOGENE PROBES
1
作者 王世浚 单祥年 +10 位作者 张丽珊 高翼之 赵寿元 张志平 李方园 张芹 严明 黄鹰 茅一萍 蒋清 贺林 《Chinese Journal of Cancer Research》 SCIE CAS CSCD 1990年第2期22-26,共5页
By using c-Ha-ras-1, N-ras Wigler (left sequence) and P52C.(right sequence), c-sis, v-erbB, c-myc and v-fos oncogenes as probes, restriction fragment length polymorphisms (RFLPs) of tumor tissue DNAs of 95 patients wi... By using c-Ha-ras-1, N-ras Wigler (left sequence) and P52C.(right sequence), c-sis, v-erbB, c-myc and v-fos oncogenes as probes, restriction fragment length polymorphisms (RFLPs) of tumor tissue DNAs of 95 patients with gastric carcinoma, primary hepatic carcinoma and brain tumor, and those of 90 normal individuals were studied with the techniques of Southern blot and dot blot. Gene amplification and recombination were also examined in some tumors simultaneously. Some alleles of oncogene are reported in Chinese population for the first time. Moreover, the characteristic frequency of some "rare" alleles and genotypes occurred in some tumor samples is significantly higher than that occured in normal individuals. Pedigree analysis for 2 patients showed that some "rare" alleles are also abandant. Besides, gene amplification and recombination were found in some tumors. 展开更多
关键词 STUDY ON THE RFLPs AND amplication AND REARRANGEMENT OF THE TRANSFORMING GENES IN PRIMARY HEPATIC CARCINOMA GASTRIC CARCINOMA AND BRAIN TUMOR WITH SIX HUMAN ONCOGENE PROBES gene
暂未订购
Study on the application of short tandem repeat (SIR) complex amplication technique in difficult cases of paternity test
2
《中国输血杂志》 CAS CSCD 2001年第S1期368-,共1页
关键词 SIR complex amplication technique in difficult cases of paternity test Study on the application of short tandem repeat
在线阅读 下载PDF
Pulse Amplification in Dispersion-Decreasing Fibers with Symbolic Computation
3
作者 LIU Wen-Jun TIAN Bo +2 位作者 XU Tao CAI Ke-Jie ZHANG Huan 《Communications in Theoretical Physics》 SCIE CAS CSCD 2009年第12期1076-1080,共5页
The pulse amplification in the dispersion-decreasing fiber (DDF) is investigated via symbolic computation to solve the variable-coefficient higher-order nonlinear Schrfdinger equation with the effects of third-order... The pulse amplification in the dispersion-decreasing fiber (DDF) is investigated via symbolic computation to solve the variable-coefficient higher-order nonlinear Schrfdinger equation with the effects of third-order dispersion, self-steepening, and stimulated Raman scattering. The analytic one-soliton solution of this model is obtained with a set of parametric conditions. Based on this solution, the fundamental soliton is shown to be amplified in the DDF. The comparison of the amplitude of pulses for different dispersion profiles of the DDF is also performed through the graphical analysis. The results of this paper would be of certain value to the study of signal amplification and pulse compression. 展开更多
关键词 fundamental soliton pulse amplication variable-coefficient higher-order nonlinear Schrodingerequation symbolic computation dispersion-decreasing fiber
在线阅读 下载PDF
Write-Optimized B^(+) Tree Index Technology for Persistent Memory 被引量:1
4
作者 Rui-Xiang Ma Fei Wu +3 位作者 Bu-Rong Dong Meng Zhang Wei-Jun Li Chang-Sheng Xie 《Journal of Computer Science & Technology》 SCIE EI CSCD 2021年第5期1037-1050,共14页
Due to its low latency,byte-addressable,non-volatile,and high density,persistent memory(PM)is expected to be used to design a high-performance storage system.However,PM also has disadvantages such as limited endurance... Due to its low latency,byte-addressable,non-volatile,and high density,persistent memory(PM)is expected to be used to design a high-performance storage system.However,PM also has disadvantages such as limited endurance,thereby proposing challenges to traditional index technologies such as B(+)tree.B(+)tree is originally designed for dynamic random access memory(DRAM)-based or disk-based systems and has a large write amplification problem.The high write amplification is detrimental to a PM-based system.This paper proposes WO-tree,a write-optimized B(+)tree for PM.WO-tree adopts an unordered write mechanism for the leaf nodes,and the unordered write mechanism can reduce a large number of write operations caused by maintaining the entry order in the leaf nodes.When the leaf node is split,WO-tree performs the cache line flushing operation after all write operations are completed,which can reduce frequent data flushing operations.WO-tree adopts a partial logging mechanism and it only writes the log for the leaf node.The inner node recognizes the data inconsistency by the read operation and the data can be recovered using the leaf node information,thereby significantly reducing the logging overhead.Furthermore,WO-tree adopts a lock-free search for inner nodes,which reduces the locking overhead for concurrency operation.We evaluate WO-tree using the Yahoo!Cloud Serving Benchmark(YCSB)workloads.Compared with traditional B(+)tree,wB-tree,and Fast-Fair,the number of cache line flushes caused by WO-tree insertion operations is reduced by 84.7%,22.2%,and 30.8%,respectively,and the execution time is reduced by 84.3%,27.3%,and 44.7%,respectively. 展开更多
关键词 persist memory B^(+)tree write amplication CONSISTENCY YCSB(Yahoo!Cloud Serving Benchmark)
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部