首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   893篇
  免费   27篇
教育   604篇
科学研究   77篇
各国文化   12篇
体育   137篇
综合类   1篇
文化理论   13篇
信息传播   76篇
  2023年   4篇
  2022年   14篇
  2021年   24篇
  2020年   29篇
  2019年   46篇
  2018年   60篇
  2017年   62篇
  2016年   59篇
  2015年   33篇
  2014年   31篇
  2013年   145篇
  2012年   40篇
  2011年   31篇
  2010年   28篇
  2009年   20篇
  2008年   41篇
  2007年   20篇
  2006年   12篇
  2005年   20篇
  2004年   18篇
  2003年   11篇
  2002年   9篇
  2001年   9篇
  2000年   13篇
  1999年   8篇
  1998年   9篇
  1997年   4篇
  1996年   3篇
  1993年   5篇
  1991年   5篇
  1990年   4篇
  1989年   5篇
  1988年   7篇
  1987年   4篇
  1986年   5篇
  1985年   5篇
  1984年   3篇
  1983年   5篇
  1982年   4篇
  1981年   4篇
  1978年   6篇
  1977年   3篇
  1976年   3篇
  1973年   5篇
  1972年   3篇
  1962年   3篇
  1957年   3篇
  1956年   3篇
  1955年   4篇
  1954年   4篇
排序方式: 共有920条查询结果,搜索用时 15 毫秒
41.
42.
Abstract

A common theme in the distance education literature is that delivery technologies with the potential for real‐time interactivity will improve both the image and practice of distance education. Although there appears to be a growing acceptance of a causal relationship between system interactivity and instructional interaction, neither concept has been clearly or functionally defined. This article discusses several systems models and relates them to the contexts of instructional delivery, instructional design, instructional theory, and learning theory in an attempt to establish conceptual parameters for the function of interaction.  相似文献   
43.
The paper uses Ludwig Wittgenstein's theories about the relationship between thought, language, and objects of the world to explore the assumption that OO-thinking resembles natural thinking. The paper imports from research in linguistic philosophy to computer science education research. I show how UML class diagrams (i.e., an artificial context-free language) correspond to the logically perfect languages described in Tractatus Logico-Philosophicus. In Philosophical Investigations Wittgenstein disputes his previous theories by showing that natural languages are not constructed by rules of mathematical logic, but are language games where the meaning of a word is constructed through its use in social contexts. Contradicting the claim that OO-thinking is easy to learn because of its similarity to natural thinking, I claim that OO-thinking is difficult to learn because of its differences from natural thinking. The nature of these differences is not currently well known or appreciated. I suggest how explicit attention to the nature and implications of different language games may improve the teaching and learning of OO-modeling as well as programming.  相似文献   
44.
We analyze the impact of exercising sports during childhood and adolescence on educational attainment. The theoretical framework is based on models of allocation of time and educational productivity. Using the rich information from the German Socio-Economic Panel (GSOEP), we apply generalized ordered probit models to estimate the effect of participation in sport activities on secondary school degrees and professional degrees. Even after controlling for important variables and selection into sport, we find strong evidence that the effect of sport on educational attainment is statistically significant and positive.  相似文献   
45.
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing attention recently. Many industrial and scientific applications call for solutions of the RkNN problem in arbitrary metric spaces where the data objects are not Euclidean and only a metric distance function is given for specifying object similarity. Usually, these applications need a solution for the generalized problem where the value of k is not known in advance and may change from query to query. In addition, many applications require a fast approximate answer of RkNN-queries. For these scenarios, it is important to generate a fast answer with high recall. In this paper, we propose the first approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our approach uses the advantages of existing metric index structures but proposes to use an approximation of the nearest-neighbor-distances in order to prune the search space. We show that our method scales significantly better than existing non-approximative approaches while producing an approximation of the true query result with a high recall.  相似文献   
46.
47.
48.
49.
50.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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