期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
试评文学的“自足”说
1
作者 彭犀帧 《吉安师专学报》 1989年第3期 1-7,共7页
近几年来,在关于文学艺术本质问题的探讨中,有不少同志从强调文学艺术的特殊性出发,提出文学是一个独立、自足、完整的世界,要真正科学地研究文学,就不能不专注文学,回复到文学自身。甚至有的同志还进一步提出;“不能脱离作为一... 近几年来,在关于文学艺术本质问题的探讨中,有不少同志从强调文学艺术的特殊性出发,提出文学是一个独立、自足、完整的世界,要真正科学地研究文学,就不能不专注文学,回复到文学自身。甚至有的同志还进一步提出;“不能脱离作为一种‘自为之物”的文学本身正确阐明文学的本质”, 展开更多
关键词 文学艺术 “自足性” 审美意识 特殊性
全文增补中
Effects of Abnormal Early Rearing Environments on Fear Memory in Adult Rats
2
作者 李传玉 张波 +3 位作者 李振邦 黄伏连 田绍文 胡新天 《Zoological Research》 CAS CSCD 北大核心 2009年第1期31-37,共7页
In the present experiment, Pavlovian fear conditioning was adopted to study the effects of different early rearing environments on fear conditioning in adult rats. Weaned rats were reared in three manipulable environm... In the present experiment, Pavlovian fear conditioning was adopted to study the effects of different early rearing environments on fear conditioning in adult rats. Weaned rats were reared in three manipulable environments (enriched, social and isolated conditions). After 8 weeks, fear conditioning (characterized by percentage of freezing) was observed and analyzed, and rats' weight, locomoter activity and foot-shock sensitivity were operated too. The results showed that: (1) Compared with control group, the level of conditioned fear was significantly increased in enriched group, but significantly decreased in isolated group; (2) Enriched and isolated conditions influenced rat's weight significantly; (3) Different rearing conditions have no effect on locomoter activity and foot-shock sensitivity. These results indicated that early enriched condition could improve the tone-evoked fear conditioning response, while isolated condition impaired the response. 展开更多
关键词 Fear conditioning FREEZING Enriched condition Isolated condition Locomoter activity Foot-shock sensitivity
下载PDF
On k-Positive Satisfiability Problem
3
作者 黄雄 李未 《Journal of Computer Science & Technology》 SCIE EI CSCD 1999年第4期309-313,共5页
An algorithm for solving the satisfiability problem is presented. It isproceed that this algorithm solves 2-SAT and Horn-SAT in linear time and k-positiveSAT (in which every clause contains at most k positive literals... An algorithm for solving the satisfiability problem is presented. It isproceed that this algorithm solves 2-SAT and Horn-SAT in linear time and k-positiveSAT (in which every clause contains at most k positive literals) ill time O(F.),where F is the length of input F, n is the number of atoms occurring in F, and k isthe greatest real number satisfying the equation x = 2-. Compared with previousresults, this nontrivial upper bound on time complexity could only be obtained fork-SAT, which is a subproblem of k-positive SAT. 展开更多
关键词 analysis of algorithms automatic theorem proving computational##BHUANG Xiong received his B.S. and M.S. degrees in computer science from Peking Universityin 1992 and 1995 respectively. Now he is a Ph.D. candidate in Beijing University of Aer
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部