全文获取类型
收费全文 | 2899篇 |
免费 | 6篇 |
专业分类
教育 | 1997篇 |
科学研究 | 526篇 |
体育 | 82篇 |
综合类 | 7篇 |
文化理论 | 62篇 |
信息传播 | 231篇 |
出版年
2022年 | 3篇 |
2021年 | 14篇 |
2020年 | 1篇 |
2019年 | 4篇 |
2018年 | 54篇 |
2017年 | 98篇 |
2016年 | 166篇 |
2015年 | 114篇 |
2014年 | 52篇 |
2013年 | 60篇 |
2012年 | 150篇 |
2011年 | 165篇 |
2010年 | 81篇 |
2009年 | 30篇 |
2008年 | 67篇 |
2007年 | 58篇 |
2006年 | 47篇 |
2005年 | 686篇 |
2004年 | 471篇 |
2003年 | 301篇 |
2002年 | 132篇 |
2001年 | 64篇 |
2000年 | 30篇 |
1999年 | 25篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 4篇 |
1976年 | 2篇 |
排序方式: 共有2905条查询结果,搜索用时 15 毫秒
81.
82.
Evrikleia?Tsagala Maria?KordakiEmail author 《Education and Information Technologies》2007,12(4):281-295
This paper aims to determine the factors affecting the decisions of both male and female secondary school pupils whether or
not to pursue undergraduate studies in Computing. It is based on research conducted in Greece, on a sample of 248 pupils,
135 of whom were female. All were aged 17 and about to decide on their future undergraduate studies. Questionnaires were used,
addressing issues in the following four main categories: a) the reasons pupils chose/rejected Computing, b) how family and
friends, the media and the school environment contribute to their decision, c) how pupils perceived their future after studying
Computing and d) how pupils perceived the profile of a computer professional in terms of gender.
相似文献
Maria KordakiEmail: |
83.
IPv4, the workhorse protocol of the currently popular TCP/ IP protocol suite, is fast becoming obsolete. The exponential growth
of the Internet is the main reason that has required the creation of the next generation of Internet Protocol-IPv6. IPv6 is
much more flexible and promises to take care of the address space and security issues in the foreseeable future.
Part 1 of the paper lays the foundation of the various issues involved in designing the Internet Protocol and motivates the
need for an upgraded version of this protocol. 相似文献
84.
85.
In many Western science systems, funding structures increasingly stimulate academic research to contribute to practical applications,
but at the same time the rise of bibliometric performance assessments have strengthened the pressure on academics to conduct
excellent basic research that can be published in scholarly literature. We analyze the interplay between these two developments
in a set of three case studies of fields of chemistry in the Netherlands. First, we describe how the conditions under which
academic chemists work have changed since 1975. Second, we investigate whether practical applications have become a source
of credibility for individual researchers. Indeed, this turns out to be the case in catalysis, where connecting with industrial
applications helps in many steps of the credibility cycle. Practical applications yield much less credibility in environmental
chemistry, where application-oriented research agendas help to acquire funding, but not to publish prestigious papers or to
earn peer recognition. In biochemistry practical applications hardly help in gaining credibility, as this field is still strongly
oriented at fundamental questions. The differences between the fields can be explained by the presence or absence of powerful
upstream end-users, who can afford to invest in academic research with promising long term benefits. 相似文献
86.
87.
88.
Andreas Bauer Jan Romberg Bernhard Sch?tz 《Informatik - Forschung und Entwicklung》2005,49(3):194-205
Zur Beherrschung der komplexen vernetzten und verteilten Funktionen von Automotive-Software ist eine Beschreibung des zu erstellenden
Systems auf verschiedenen Abstraktionsebenen und schrittweise überg?nge zwischen diesen Ebenen notwendig. Neben der Definition
geeigneter Ebenen werden zur Unterstützung echtzeitkritischer Systemanteile ein einheitliches Berechnungsmodell, ebenenspezifische
Beschreibungstechniken, sowie methodische Regeln für diese Abstraktionsebenen eingeführt und in den Werkzeugprototypen AutoFocus integriert. 相似文献
89.
Wolfgang Schr?der-Preikschat Daniel Lohmann Fabian Scheler Olaf Spinczyk 《Informatik - Forschung und Entwicklung》2007,22(1):5-22
Design, implementation, and re-engineering of operating systems are still an ambitious undertaking.
Despite, or even because, of the long history of theory and practice in this field, adapting existing systems
to environments of different conditions and requirements as originally specified or assumed, in terms of
functional and/or non-functional respects, is anything but simple. Especially this is true for the embedded
systems domain which, on the one hand, calls for highly specialized and application-aware system abstractions
and, on the other hand, cares a great deal for easily reusable implementations of these abstractions.
The latter aspect becomes more and more important as embedded systems technology is faced with an innovation
cycle decreasing in length. Software for embedded systems needs to be designed for variability, and this
is in particular true for the operating systems of this domain. The paper discusses dimensions of variability
that need to be considered in the development of embedded operating systems and presents approaches that
aid construction and maintenance of evolutionary operating systems.
CR subject classification C.3; D.2.11; D.2.13; D.4.7 相似文献
90.
Elke Achtert Christian B?hm Peer Kr?ger Peter Kunath Alexey Pryakhin Matthias Renz 《Informatik - Forschung und Entwicklung》2007,15(3):179-195
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. 相似文献