全文获取类型
收费全文 | 35454篇 |
免费 | 1218篇 |
国内免费 | 251篇 |
专业分类
化学 | 24748篇 |
晶体学 | 249篇 |
力学 | 850篇 |
数学 | 5789篇 |
物理学 | 5287篇 |
出版年
2023年 | 202篇 |
2022年 | 303篇 |
2021年 | 450篇 |
2020年 | 563篇 |
2019年 | 529篇 |
2018年 | 431篇 |
2017年 | 417篇 |
2016年 | 943篇 |
2015年 | 806篇 |
2014年 | 885篇 |
2013年 | 1912篇 |
2012年 | 2102篇 |
2011年 | 2604篇 |
2010年 | 1278篇 |
2009年 | 1115篇 |
2008年 | 2199篇 |
2007年 | 2221篇 |
2006年 | 2154篇 |
2005年 | 2011篇 |
2004年 | 1728篇 |
2003年 | 1482篇 |
2002年 | 1377篇 |
2001年 | 474篇 |
2000年 | 467篇 |
1999年 | 405篇 |
1998年 | 372篇 |
1997年 | 378篇 |
1996年 | 515篇 |
1995年 | 359篇 |
1994年 | 321篇 |
1993年 | 285篇 |
1992年 | 285篇 |
1991年 | 251篇 |
1990年 | 211篇 |
1989年 | 213篇 |
1988年 | 243篇 |
1987年 | 203篇 |
1985年 | 358篇 |
1984年 | 348篇 |
1983年 | 250篇 |
1982年 | 317篇 |
1981年 | 324篇 |
1980年 | 302篇 |
1979年 | 282篇 |
1978年 | 258篇 |
1977年 | 231篇 |
1976年 | 208篇 |
1975年 | 210篇 |
1974年 | 210篇 |
1973年 | 212篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
131.
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. 相似文献
132.
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. 相似文献
133.
134.
135.
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 相似文献
136.
David Swanson William P. Ziemer 《Calculus of Variations and Partial Differential Equations》2002,14(1):69-84
Let be a connected open set, . We give a sufficient condition for a mapping , , to have the property that sgn is almost everywhere of one sign. Following the work of Müller, Spector, and Tang [MST], we give an application of our results
to the theory of non-linear elasticity.
Received: 13 October 2000 / Accepted: 23 January 2001 / Published online: 4 May 2001 相似文献
137.
138.
139.
Summary. We examine the convergence characteristics of iterative methods based on a new preconditioning operator for solving the linear
systems arising from discretization and linearization of the steady-state Navier-Stokes equations. With a combination of analytic
and empirical results, we study the effects of fundamental parameters on convergence. We demonstrate that the preconditioned
problem has an eigenvalue distribution consisting of a tightly clustered set together with a small number of outliers. The
structure of these distributions is independent of the discretization mesh size, but the cardinality of the set of outliers
increases slowly as the viscosity becomes smaller. These characteristics are directly correlated with the convergence properties
of iterative solvers.
Received August 5, 2000 / Published online June 20, 2001 相似文献
140.
Lisa Higham David Kirkpatrick Karl Abrahamson Andrew Adler 《Journal of Algorithms in Cognition, Informatics and Logic》1997,23(2):291-328
Probabilistic algorithms are developed for a basic problem in distributed computation, assuming anonymous, asynchronous, unidirectional rings of processors. The problem, known as Solitude Detection, requires that a nonempty subset of the processors, calledcontenders, determine whether or not there is exactly one contender. Monte Carlo algorithms are developed that err with probability bounded by a specified parameter and exhibit either message or processor termination. The algorithms transmit an optimal expected number of bits, to within a constant factor. Their bit complexities display a surprisingly rich dependence on the kind of termination exhibited and on the processors' knowledge of the size of the ring. Two probabilistic tools are isolated and then combined in various ways to achieve all our algorithms. 相似文献