全文获取类型
收费全文 | 32660篇 |
免费 | 1080篇 |
国内免费 | 249篇 |
专业分类
化学 | 22676篇 |
晶体学 | 223篇 |
力学 | 769篇 |
数学 | 5422篇 |
物理学 | 4899篇 |
出版年
2022年 | 283篇 |
2021年 | 421篇 |
2020年 | 514篇 |
2019年 | 484篇 |
2018年 | 376篇 |
2017年 | 372篇 |
2016年 | 835篇 |
2015年 | 737篇 |
2014年 | 807篇 |
2013年 | 1726篇 |
2012年 | 1866篇 |
2011年 | 2352篇 |
2010年 | 1141篇 |
2009年 | 1004篇 |
2008年 | 2009篇 |
2007年 | 2020篇 |
2006年 | 1996篇 |
2005年 | 1863篇 |
2004年 | 1587篇 |
2003年 | 1383篇 |
2002年 | 1282篇 |
2001年 | 402篇 |
2000年 | 388篇 |
1999年 | 359篇 |
1998年 | 335篇 |
1997年 | 358篇 |
1996年 | 486篇 |
1995年 | 344篇 |
1994年 | 298篇 |
1993年 | 270篇 |
1992年 | 268篇 |
1991年 | 237篇 |
1990年 | 202篇 |
1989年 | 203篇 |
1988年 | 232篇 |
1987年 | 199篇 |
1986年 | 181篇 |
1985年 | 347篇 |
1984年 | 341篇 |
1983年 | 242篇 |
1982年 | 313篇 |
1981年 | 323篇 |
1980年 | 298篇 |
1979年 | 281篇 |
1978年 | 257篇 |
1977年 | 227篇 |
1976年 | 206篇 |
1975年 | 208篇 |
1974年 | 210篇 |
1973年 | 209篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
81.
The historical development of Hensel's lemma is briefly discussed (Section 1). Using Newton polygons, a simple proof of a general Hensel's lemma for separable polynomials over Henselian fields is given (Section 3). For polynomials over algebraically closed, valued fields, best possible results on continuity of roots (Section 4) and continuity of factors (Section 6) are demonstrated. Using this and a general Krasner's lemma (Section 7), we give a short proof of a general Hensel's lemma and show that it is, in a certain sense, best possible (Section 8). All valuations here are non-Archimedean and of arbitrary rank. The article is practically self-contained. 相似文献
82.
83.
84.
Nonequilibrium statistical mechanics close to equilibrium is studied using SRB states and a formula [10] for their derivatives
with respect to parameters. We write general expressions for the thermodynamic fluxes (or currents) and the transport coefficients,
generalizing the results of [4, 5]. In this framework we give a general proof of the Onsager reciprocity relations.
Received: 2 December 1996 / Accepted: 13 March 1997 相似文献
85.
In this paper a statistical multiplexer that processes a mixture of real-time and non-real-time traffic is studied under bursts of traffic. Different scheduling algorithms are compared under conditions when one of the classes of traffic has a sudden increase in its arrival rate during a short period of time. The results show a difference in the way the scheduling disciplines studied behave under short overloads of traffic even though the scheduling algorithms had been set up to give similar performance under steady-state arrivals. The lifetime of real-time packets is shown to have a great effect on the way in which the performance of the scheduling algorithms compare.Robert Lackman is an IBM employee in the IBM Resident Study Program. 相似文献
86.
David E. Griffiths 《应用有机金属化学》1994,8(2):149-161
Dibutyltin-3-hydroxyflavone, Bu2Sn(of), is a new fluorescence probe inhibitor of F1F0-ATPase and oxidative phosphorylation which inhibits by titration of an unidentified component of F0. Its site of action is closely related to that of the trialkyltins and of venturicidin. This F0 component is part of a pool of this component which is present in the heart mitochondrial inner membrane at levels of 5–7 nmol (mg protein)?1 [18 ± 3 Bu2Sn(of) sites per mol F1F0-ATPase]. However, ATPase activity in submitochondrial particles is near maximally inhibited by titration of approx. three Bu2Sn(of) sites per mol F1F0-ATPase. Over 60% (60–80%) of the Bu2Sn(of) interaction sites can be lost during the purification of F1F0-ATPase from submitochondrial particles. The number of Bu2Sn(of) interaction sites in various F1F0-ATPase preparations is variable. The high numbers of Bu2Sn(of) sites per mol F1F0-ATPase for heart mitochondria (18–21) and submitochondrial particles (15–19.5) decline in ATP synthase (11–15) to the low values obtained in Complex V (7–10.5) and the minimal values observed in highly purified F1F0?ATPase (3.5–5.6), thus indicating a variable dissociable component or cofactor of ATP synthase. The Bu2Sn(of) interaction site, a component of ATP synthase, is responsive to the redox status of the respiratory chain and the interaction with Bu2Sn(of) is with the reduced form of this component. Fluorescence titration studies show that this component is in redox equilibrium with the ubiquinone pool of the respiratory chain. It is proposed that this redox component serves as an inhibitor titratable cofactor pool which cycles through an F0 interaction site (or sites) via a system which serves as an energy-transfer link between the respiratory chain and ATP synthase. 相似文献
87.
Dai Lu David Rutledge Milan Kovacevic Jon Hacker 《International Journal of Infrared and Millimeter Waves》2002,23(5):693-704
This paper presents an active patch array designed at 24 GHz. It can be used as a front-end component for a phased array. A series resonant array structure is chosen which is compact and easy excite. With 5 elements, the array proved a 12-dB antenna gain. A power amplifier and a low noise amplifier are designed on a single GaAs chip (PALNA). Bias switch is used in the PALNA, which greatly reduces the switch loss in a transceiver and increases the efficiency. 20-dB small signal gain is achieved in both power amplifier and low noise amplifier. The active patch array is built by the combination of the patch array and PALNA. The measured active gain of this antenna is 35-dB for the PA mode and 31-dB for the LNA mode. This active patch array can obtain an EIRP of 34 dBm with a total radiated power of 22dBm and a maximum PAE of 32%. To check the noise performance, we applied sources at both normal temperature and 77K (liquid nitrogen) and extracted the noise figure (3.5 dB) of the active antenna by the Y factor method. The results proved that the active antenna is working efficiently as both a transmitting and receiving antenna. 相似文献
88.
89.
90.
David P. Williamson 《Mathematical Programming》2002,91(3):447-478
In this survey, we give an overview of a technique used to design and analyze algorithms that provide approximate solutions
to NP-hard problems in combinatorial optimization. Because of parallels with the primal-dual method commonly used in combinatorial
optimization, we call it the primal-dual method for approximation algorithms. We show how this technique can be used to derive
approximation algorithms for a number of different problems, including network design problems, feedback vertex set problems,
and facility location problems.
Received: June 19, 2000 / Accepted: February 7, 2001?Published online October 2, 2001 相似文献