首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   47篇
  免费   0篇
  2021年   1篇
  2019年   2篇
  2017年   1篇
  2016年   2篇
  2015年   2篇
  2014年   2篇
  2013年   8篇
  2009年   2篇
  2007年   2篇
  2006年   3篇
  2005年   3篇
  2004年   2篇
  2003年   4篇
  2002年   1篇
  2001年   1篇
  1998年   1篇
  1996年   2篇
  1995年   1篇
  1993年   1篇
  1989年   2篇
  1988年   1篇
  1984年   1篇
  1975年   2篇
排序方式: 共有47条查询结果,搜索用时 15 毫秒
41.
The present study concerns a Dutch computer-based assessment, which includes an assessment process about information literacy and a feedback process for students. The assessment is concerned with the measurement of skills in information literacy and the feedback process with item-based support to improve student learning. To analyze students’ feedback behavior (i.e. feedback use and attention time), test performance, and speed of working, a multivariate hierarchical latent variable model is proposed. The model can handle multivariate mixed responses from multiple sources related to different processes and comprehends multiple measurement components for responses and response times. A flexible within-subject latent variable structure is defined to explore multiple individual latent characteristics related to students’ test performance and feedback behavior. Main results of the computer-based assessment showed that feedback-information pages were less visited by well-performing students when they relate to easy items. Students’ attention paid to feedback was positively related to working speed but not to the propensity to use feedback.  相似文献   
42.
43.
Cognitive abilities used by arthropods, particularly predators, when interacting in a natural context have been poorly studied. Two neotropical sympatric predators, the golden silk spider Nephila clavipes and the ectatommine ant Ectatomma tuberculatum, were observed in field conditions where their interactions occurred regularly due to the exploitation of the same patches of vegetation. Repeated presentations of E. tuberculatum workers ensnared in their web triggered a progressive decrease in the capture response of N. clavipes. All the spiders that stopped trying to catch the ant on the second and/or third trial were individuals that had been bitten during a previous trial. Behavioural tests in natural field conditions showed that after a single confrontation with ant biting, spiders were able to discriminate this kind of prey more quickly from a defenceless prey (fruit flies) and to selectively and completely suppress their catching response. This one-trial aversive learning was still effective after 24 h. Likewise, E. tuberculatum workers entangled once on a N. clavipes web and having succeeded in escaping, learned to escape more quickly, breaking through the web by preferentially cutting spiral threads (sticky traps) rather than radial threads (stronger structural unsticky components) or pursuing the cutting of radials but doing it more quickly. Both strategies, based on a one-trial learning capability, obviously minimize the number of physical encounters between the two powerful opponents and may enhance their fitness by diminishing the risk of potential injuries resulting from predatory interactions.  相似文献   
44.
As human randomness production has come to be more closely studied and used to assess executive functions (especially inhibition), many normative measures for assessing the degree to which a sequence is randomlike have been suggested. However, each of these measures focuses on one feature of randomness, leading researchers to have to use multiple measures. Although algorithmic complexity has been suggested as a means for overcoming this inconvenience, it has never been used, because standard Kolmogorov complexity is inapplicable to short strings (e.g., of length l?≤?50), due to both computational and theoretical limitations. Here, we describe a novel technique (the coding theorem method) based on the calculation of a universal distribution, which yields an objective and universal measure of algorithmic complexity for short strings that approximates Kolmogorov–Chaitin complexity.  相似文献   
45.
46.
47.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号