全文获取类型
收费全文 | 1772篇 |
免费 | 72篇 |
国内免费 | 8篇 |
专业分类
化学 | 914篇 |
晶体学 | 24篇 |
力学 | 103篇 |
数学 | 449篇 |
物理学 | 362篇 |
出版年
2023年 | 18篇 |
2022年 | 22篇 |
2021年 | 21篇 |
2020年 | 50篇 |
2019年 | 50篇 |
2018年 | 60篇 |
2017年 | 53篇 |
2016年 | 102篇 |
2015年 | 66篇 |
2014年 | 82篇 |
2013年 | 294篇 |
2012年 | 75篇 |
2011年 | 74篇 |
2010年 | 67篇 |
2009年 | 63篇 |
2008年 | 50篇 |
2007年 | 49篇 |
2006年 | 62篇 |
2005年 | 24篇 |
2004年 | 39篇 |
2003年 | 23篇 |
2002年 | 30篇 |
2001年 | 30篇 |
2000年 | 19篇 |
1999年 | 26篇 |
1998年 | 23篇 |
1997年 | 23篇 |
1996年 | 17篇 |
1995年 | 19篇 |
1994年 | 19篇 |
1993年 | 15篇 |
1992年 | 13篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1989年 | 8篇 |
1988年 | 15篇 |
1987年 | 11篇 |
1985年 | 18篇 |
1984年 | 12篇 |
1983年 | 10篇 |
1982年 | 11篇 |
1981年 | 20篇 |
1980年 | 12篇 |
1979年 | 11篇 |
1978年 | 6篇 |
1977年 | 8篇 |
1975年 | 12篇 |
1973年 | 5篇 |
1971年 | 5篇 |
1927年 | 6篇 |
排序方式: 共有1852条查询结果,搜索用时 78 毫秒
71.
72.
Syariza Abdul-Rahman Edmund K. Burke Andrzej Bargiela Barry McCollum Ender Özcan 《Annals of Operations Research》2014,218(1):3-21
In this study, we investigate an adaptive decomposition and ordering strategy that automatically divides examinations into difficult and easy sets for constructing an examination timetable. The examinations in the difficult set are considered to be hard to place and hence are listed before the ones in the easy set in the construction process. Moreover, the examinations within each set are ordered using different strategies based on graph colouring heuristics. Initially, the examinations are placed into the easy set. During the construction process, examinations that cannot be scheduled are identified as the ones causing infeasibility and are moved forward in the difficult set to ensure earlier assignment in subsequent attempts. On the other hand, the examinations that can be scheduled remain in the easy set. Within the easy set, a new subset called the boundary set is introduced to accommodate shuffling strategies to change the given ordering of examinations. The proposed approach, which incorporates different ordering and shuffling strategies, is explored on the Carter benchmark problems. The empirical results show that the performance of our algorithm is broadly comparable to existing constructive approaches. 相似文献
73.
74.
Thomas Özgün Dr. Klaus Bergander Dr. Lei Liu Dr. Constantin G. Daniliuc Prof. Dr. Stefan Grimme Dr. Gerald Kehr Prof. Dr. Gerhard Erker 《Chemistry (Weinheim an der Bergstrasse, Germany)》2016,22(34):11958-11961
The energy profile of a frustrated Lewis pair (FLP) dihydrogen splitting system was determined by a combined experimental kinetic and DFT study. A trimethylene‐bridged phosphane–borane FLP was converted into its endothermic H2‐cleavage product by sequential H+/H? addition. The system could be handled at low temperature, and the kinetics of the H2 elimination were determined to give a rate constant of kHH,exp(299 K)=(2.87±0.1)×10?4 s?1 in solution. The primary kinetic isotope effects were determined; for example, (kHH/kDD)exp=3.19. The system was accurately analyzed by DFT calculations. 相似文献
75.
Ukrainian Mathematical Journal - The method of Green’s functional is a little-known technique for the construction of fundamental solutions to linear ordinary differential equations (ODE)... 相似文献
76.
Ukrainian Mathematical Journal - We determine some classes of left modules satisfying the radical formula in a noncommutative ring. We also show that, under a certain condition, a finitely... 相似文献
77.
78.
Journal of Thermal Analysis and Calorimetry - In the original publication of the article, peak numbers were not given in figure 4. The corrected figure 4 is given below. 相似文献
79.
Semra Öztürk Kaptanoğlu 《Algebras and Representation Theory》2014,17(5):1437-1455
We introduce the class of restricted k[A]-modules and p t -Jordan types for a finite abelian p-group A of exponent at least p t and a field k of characteristic p. For these modules, we generalize several theorems by Benson, verify a generalization of conjectures stated by Suslin and Rickard giving constraints on Jordan types for modules of constant Jordan type when t is 1. We state conjectures giving constraints on p t -Jordan types and show that many p t -Jordan types are realizable. 相似文献
80.