全文获取类型
收费全文 | 87204篇 |
免费 | 657篇 |
国内免费 | 442篇 |
专业分类
化学 | 30267篇 |
晶体学 | 843篇 |
力学 | 7014篇 |
数学 | 33611篇 |
物理学 | 16568篇 |
出版年
2023年 | 59篇 |
2022年 | 157篇 |
2021年 | 254篇 |
2020年 | 196篇 |
2019年 | 214篇 |
2018年 | 10553篇 |
2017年 | 10336篇 |
2016年 | 6364篇 |
2015年 | 1130篇 |
2014年 | 598篇 |
2013年 | 901篇 |
2012年 | 4410篇 |
2011年 | 11123篇 |
2010年 | 6031篇 |
2009年 | 6448篇 |
2008年 | 7162篇 |
2007年 | 9274篇 |
2006年 | 771篇 |
2005年 | 1777篇 |
2004年 | 1922篇 |
2003年 | 2276篇 |
2002年 | 1338篇 |
2001年 | 394篇 |
2000年 | 406篇 |
1999年 | 252篇 |
1998年 | 288篇 |
1997年 | 252篇 |
1996年 | 323篇 |
1995年 | 192篇 |
1994年 | 185篇 |
1993年 | 172篇 |
1992年 | 132篇 |
1991年 | 125篇 |
1990年 | 113篇 |
1989年 | 114篇 |
1988年 | 104篇 |
1987年 | 105篇 |
1986年 | 95篇 |
1985年 | 96篇 |
1984年 | 113篇 |
1983年 | 80篇 |
1982年 | 92篇 |
1981年 | 71篇 |
1980年 | 91篇 |
1979年 | 78篇 |
1978年 | 70篇 |
1977年 | 49篇 |
1914年 | 46篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 453 毫秒
991.
We study the dynamics in the neighborhood of an invariant torus of a nearly integrable system. We provide an upper bound to the diffusion speed, which turns out to be of superexponentially small size exp[-exp(1/)], being the distance from the invariant torus. We also discuss the connection of this result with the existence of many invariant tori close to the considered one. 相似文献
992.
G. Bigazzi J. C. Hadler Neto P. Iunes S. Meloni M. Oddone 《Journal of Radioanalytical and Nuclear Chemistry》1995,201(6):481-493
In the present paper the use of two natural uranium dosimeters is described. Data are compared with fluence values obtained by using NIST glass standards and the traditional activation of metal foils. Finally an example is reported for application of neutron dosimetry to the dating of the Fish Canyon Tuff age standard. 相似文献
993.
Antonio Cipiciani Stefania Primieri Antonio Arcelli 《Journal of inclusion phenomena and macrocyclic chemistry》1994,15(3):207-214
The hydrolysis reaction of 2-nitro-4-carboxyphenyl acetate was studied in dichloromethane in the presence of an added electrolyte (NaOH) and cationic surfactants systems with varying quantities of added water at 25°C. The kinetic and conductivity data were correlated. 相似文献
994.
An adsorptive stripping voltammetry method for the determination of traces of molybdenum(VI) in flowing solution at a wall-jet electrode sensor has been developed. After adsorption of a molybdenum complex on a wall-jet mercury film electrode, the complex is reduced by a square wave scan. More satisfactory results were obtained using 8-hydroxyquinoline as a complexing agent in nitrate medium than using Toluidine Blue in oxalic acid. Enhanced sensitivity was achieved by optimizing adsorption time and square wave parameter values. The detection limit of Mo(VI) was found to be at the nanomolar level. Interference of some other metallic species in the determination of nanomolar Mo(VI) was also investigated: Cu(II), Zn(II), Mn(II) do not interfere at 10 muM, whereas 1 muM FeEDTA(-) causes an increase in peak current. This iron interference was removed effectively with citric acid. 相似文献
995.
John Doyle 《The Journal of the Operational Research Society》1994,45(2):203-213
Following a critique of existing algorithms, an algorithm is presented which will re-organize a 2-way data table to bring like rows together, and like columns together. Extensions of the method are described, and justified, to accommodate distances measured in modular arithmetic, and with bipolar columns/rows, as in repertory grid analysis. One value of the algorithms is that the user can see relationships in the tables without the data in the cells themselves ever having been transformed. Thus, users will continue to feel they own their data. 相似文献
996.
This paper deals with the GI x /G/c queueing system in a steady state. We refine a diffusion approximation method incorporating the constraint of traffic conservation for general queueing systems. An approximate expression for the distribution of the number of customers is obtained. Numerical results are presented to show that the refined model provides improved performance. 相似文献
997.
We describe a new branch-and-bound algorithm for the exact solution of the maximum cardinality stable set problem. The bounding phase is based on a variation of the standard greedy algorithm for finding a colouring of a graph. Two different node-fixing heuristics are also described. Computational tests on random and structured graphs and very large graphs corresponding to real-life problems show that the algorithm is competitive with the fastest algorithms known so far.This work has been supported by Agenzia Spaziale Italiana. 相似文献
998.
999.
1000.