全文获取类型
收费全文 | 11870篇 |
免费 | 643篇 |
国内免费 | 57篇 |
专业分类
化学 | 8706篇 |
晶体学 | 38篇 |
力学 | 295篇 |
数学 | 1857篇 |
物理学 | 1674篇 |
出版年
2023年 | 91篇 |
2022年 | 112篇 |
2021年 | 202篇 |
2020年 | 291篇 |
2019年 | 305篇 |
2018年 | 144篇 |
2017年 | 166篇 |
2016年 | 436篇 |
2015年 | 476篇 |
2014年 | 489篇 |
2013年 | 648篇 |
2012年 | 919篇 |
2011年 | 922篇 |
2010年 | 570篇 |
2009年 | 492篇 |
2008年 | 734篇 |
2007年 | 703篇 |
2006年 | 645篇 |
2005年 | 628篇 |
2004年 | 494篇 |
2003年 | 404篇 |
2002年 | 391篇 |
2001年 | 183篇 |
2000年 | 152篇 |
1999年 | 144篇 |
1998年 | 151篇 |
1997年 | 148篇 |
1996年 | 121篇 |
1995年 | 93篇 |
1994年 | 87篇 |
1993年 | 98篇 |
1992年 | 71篇 |
1991年 | 69篇 |
1990年 | 57篇 |
1989年 | 72篇 |
1988年 | 55篇 |
1987年 | 38篇 |
1986年 | 44篇 |
1985年 | 59篇 |
1984年 | 49篇 |
1983年 | 50篇 |
1982年 | 51篇 |
1981年 | 59篇 |
1980年 | 45篇 |
1979年 | 47篇 |
1978年 | 45篇 |
1977年 | 44篇 |
1976年 | 50篇 |
1975年 | 42篇 |
1973年 | 34篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
911.
912.
Šárka Brodinová Maia Zaharieva Peter Filzmoser Thomas Ortner Christian Breiteneder 《Advances in Data Analysis and Classification》2018,12(2):261-284
Media content in large repositories usually exhibits multiple groups of strongly varying sizes. Media of potential interest often form notably smaller groups. Such media groups differ so much from the remaining data that it may be worthy to look at them in more detail. In contrast, media with popular content appear in larger groups. Identifying groups of varying sizes is addressed by clustering of imbalanced data. Clustering highly imbalanced media groups is additionally challenged by the high dimensionality of the underlying features. In this paper, we present the imbalanced clustering (IClust) algorithm designed to reveal group structures in high-dimensional media data. IClust employs an existing clustering method in order to find an initial set of a large number of potentially highly pure clusters which are then successively merged. The main advantage of IClust is that the number of clusters does not have to be pre-specified and that no specific assumptions about the cluster or data characteristics need to be made. Experiments on real-world media data demonstrate that in comparison to existing methods, IClust is able to better identify media groups, especially groups of small sizes. 相似文献
913.
914.
A survey of berth allocation and quay crane scheduling problems in container terminals 总被引:2,自引:0,他引:2
Due to the variety of technical equipments and terminal layouts, research has produced a multitude of optimization models for seaside operations planning in container terminals. To provide a support in modeling problem characteristics and in suggesting applicable algorithms this paper reviews the relevant literature. For this purpose new classification schemes for berth allocation problems and quay crane scheduling problems are developed. Particular focus is put on integrated solution approaches which receive increasing importance for the terminal management. 相似文献
915.
916.
917.
918.
Christian Gottlieb 《代数通讯》2013,41(8):3087-3097
Abstract Although it is well known that the growth of Thompson's group F is exponential, the exact growth function is still unknown. Elements of its submonoid of positive words can be described using a binary rooted tree, whose norm can be computed assigning weights to each caret. Combining this fact with a combinatorial argument, the growth function of the submonoid is computed and thus providing a first step in the computation of the growth function of the group, as well as a lower bound for the growth rate for the group. 相似文献
919.
Walter J. Gutjahr Stefan Katzensteiner Peter Reiter Christian Stummer Michaela Denk 《European Journal of Operational Research》2010
This paper develops a multi-objective optimization model for project portfolio selection taking employee competencies and their evolution into account. The objectives can include economic gains as well as gains expressed in terms of aggregated competence increments according to pre-defined profiles. In order to determine Pareto-optimal solutions, the overall problem is decomposed into a master problem addressing the portfolio selection itself, and a slave problem dealing with a suitable assignment of personnel to the work packages of the selected projects over time. We provide an asymptotic approximation of the problem by a linearized formulation, which allows an efficient and exact solution of the slave problem. For the solution of the master problem, we compare the multi-objective metaheuristics NSGA-II and P-ACO. Experimental results both for synthetically generated test instances and for real-world test instances, based on an application case from the E-Commerce Competence Center Austria, are presented. 相似文献
920.