期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
萧条经济学如何解决经济衰退与萧条——以印刷钞票的“简单方法”和“发票子”方法为例
1
作者 刘秀光 《学术论坛》 CSSCI 北大核心 2010年第3期96-99,共4页
萧条经济学及其教义在经济衰退与萧条之时往往备受重视。萧条经济学"印刷足够的钞票"解决经济衰退与萧条的"简单方法"以及通过"发票子"搞建设的方法,许多经验数据证实了其理论和实践的合理性,当然也遭受... 萧条经济学及其教义在经济衰退与萧条之时往往备受重视。萧条经济学"印刷足够的钞票"解决经济衰退与萧条的"简单方法"以及通过"发票子"搞建设的方法,许多经验数据证实了其理论和实践的合理性,当然也遭受到不同程度的质疑。我们通过对萧条经济学代表性观点的评述,进一步认识货币在现代市场经济体系中的地位以及强化货币事务管理的意义。 展开更多
关键词 萧条经济学 衰退与萧条 “简单方法” “发票子” 货币供给冲击
下载PDF
A Simplified Method for Purifying Osteoclasts from Human Giant Cell Tumor of Bone
2
作者 王运林 向光大 夏秦 《The Chinese-German Journal of Clinical Oncology》 CAS 2005年第1期61-63,69,共4页
Objective: To purify and identify the osteoclasts from the tissue of humangiant cell tumor of bone. Methods: We have developed a new method that allows the purification oflarge numbers of authentic osteoclasts (OCs). ... Objective: To purify and identify the osteoclasts from the tissue of humangiant cell tumor of bone. Methods: We have developed a new method that allows the purification oflarge numbers of authentic osteoclasts (OCs). The OCs were isolated from tissue of human giant celltumor of bone by 0.25% trypsin and collagenase. We characterized OCs in terms of the expression ofdifferent phenotypic markers of OCs. The phenotypic markers of OC included Tartrate-resistant acidphosphatase staining (TRAP). The expression of calcitonin receptor (CTR), cathepsin K and receptoractivator of necrosis factor κB (RANK) mRNA were examined by RT-PCR. Results: The OC cell purifiedby above method functioned normally in vitro. The purity was about 79.7%. They showed the normalosteoclast phenotypes markers of OC. Conclusion: The method provides a system for performingbiochemical and molecular studies of OCs. The study indicates that the method of purifying theosteoclasts from human GCT cell can be used for research of bone metabolism. 展开更多
关键词 OSTEOCLASTS TRAP CTR cathepsin K RANK
下载PDF
A simple and efficient method for image transmission over inferior channel
3
作者 周霆 许明 +1 位作者 陈东侠 余轮 《Journal of Shanghai University(English Edition)》 CAS 2008年第2期141-145,共5页
The constrained Viterbi algorithm (C-VA) makes use of some prior reliable information to reduce complexity and improve performance of Viterbi algorithm (VA). However it can only be used in the concatenate code sch... The constrained Viterbi algorithm (C-VA) makes use of some prior reliable information to reduce complexity and improve performance of Viterbi algorithm (VA). However it can only be used in the concatenate code scheme because the detection result of cyclic redundancy check code (CRC) is exploited to provide reliable information. In this paper, a different way is proposed to provide reliable information for C-VA, which is possible to be used in simple codec. Known bits were added to the set partitioning in hierarchical trees (SPIHT) coded image sequence periodically and directly. They were thought to be reliable information for C-VA in the decoder. Experimental results show that the proposed scheme can obtain much better error resilient ability compared with conventional VA under the extremely inferior channel condition if the best desired quality of reconstructed images can be sacrificed. 展开更多
关键词 constrained Viterbi algorithm (C-VA) known bits set partitioning in hierarchical trees (SPIHT) image transmission.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部