全文获取类型
收费全文 | 11055篇 |
免费 | 439篇 |
国内免费 | 63篇 |
专业分类
化学 | 8183篇 |
晶体学 | 86篇 |
力学 | 244篇 |
数学 | 1378篇 |
物理学 | 1666篇 |
出版年
2023年 | 72篇 |
2022年 | 90篇 |
2021年 | 133篇 |
2020年 | 212篇 |
2019年 | 170篇 |
2018年 | 141篇 |
2017年 | 124篇 |
2016年 | 278篇 |
2015年 | 261篇 |
2014年 | 288篇 |
2013年 | 530篇 |
2012年 | 781篇 |
2011年 | 958篇 |
2010年 | 445篇 |
2009年 | 295篇 |
2008年 | 701篇 |
2007年 | 760篇 |
2006年 | 801篇 |
2005年 | 783篇 |
2004年 | 607篇 |
2003年 | 518篇 |
2002年 | 444篇 |
2001年 | 125篇 |
2000年 | 123篇 |
1999年 | 114篇 |
1998年 | 102篇 |
1997年 | 102篇 |
1996年 | 127篇 |
1995年 | 104篇 |
1994年 | 115篇 |
1993年 | 98篇 |
1992年 | 76篇 |
1991年 | 74篇 |
1990年 | 69篇 |
1989年 | 44篇 |
1988年 | 53篇 |
1987年 | 46篇 |
1986年 | 31篇 |
1985年 | 92篇 |
1984年 | 55篇 |
1983年 | 39篇 |
1982年 | 66篇 |
1981年 | 63篇 |
1980年 | 51篇 |
1979年 | 49篇 |
1978年 | 46篇 |
1977年 | 43篇 |
1976年 | 31篇 |
1975年 | 39篇 |
1974年 | 27篇 |
排序方式: 共有10000条查询结果,搜索用时 32 毫秒
31.
F. Sibel Salman Jayant R. Kalagnanam Sesh Murthy Andrew Davenport 《Journal of Heuristics》2002,8(2):215-239
For hard optimization problems, it is difficult to design heuristic algorithms which exhibit uniformly superior performance for all problem instances. As a result it becomes necessary to tailor the algorithms based on the problem instance. In this paper, we introduce the use of a cooperative problem solving team of heuristics that evolves algorithms for a given problem instance. The efficacy of this method is examined by solving six difficult instances of a bicriteria sparse multiple knapsack problem. Results indicate that such tailored algorithms uniformly improve solutions as compared to using predesigned heuristic algorithms. 相似文献
32.
A current interpretation of XPS spectra of Ni metal assumes that the main 6 eV satellite is due to a two hole c3d94s2 (c is a core hole) final state effect. We report REELS observation in AES at low voltages of losses (plasmons and inter-band transitions) corresponding to the satellite structures in Ni metal 2p spectra. The satellite near 6 eV is attributed to a predominant surface plasmon loss. A current interpretation of Ni 2p spectra of oxides and other compounds is based on charge transfer assignments of the main peak at 854.6 eV and the broad satellite centred at around 861 eV to the cd9L and the unscreened cd8 final-state configurations, respectively (L is a ligand hole). Multiplet splittings have been shown to be necessary for assignment of Fe 2p and Cr 2p spectral profiles and chemical states. The assignments of Ni 2p states are re-examined with intra-atomic multiplet envelopes applied to Ni(OH)2, NiOOH and NiO spectra. It is shown that the free ion multiplet envelopes for Ni2+ and Ni3+ simulate the main line and satellite structures for Ni(OH)2 and NiOOH. Fitting the NiO Ni 2p spectral profile is not as straightforward as the hydroxide and oxyhydroxide. It may involve contributions from inter-atomic, non-local electronic coupling and screening effects with multiplet structures significantly different from the free ions as found for MnO. A scheme for fitting these spectra using multiplet envelopes is proposed. 相似文献
33.
We give a small functorial algebraic model for the 2-stage Postnikov section of the K-theory spectrum of a Waldhausen category and use our presentation to describe the multiplicative structure with respect to biexact functors. 相似文献
34.
The authors introduce a new concept of measure-valued solution for the 3-D incompressible Euler equations in order to incorporate the complex phenomena present in limits of approximate solutions of these equations. One application of the concepts developed here is the following important result: a sequence of Leray-Hopf weak solutions of the Navier-Stokes equations converges in the high Reynolds number limit to a measure-valued solution of 3-D Euler defined for all positive times. The authors present several explicit examples of solution sequences for 3-D incompressible Euler with uniformly bounded local kinetic energy which exhibit complex phenomena involving both persistence of oscillations and development of concentrations. An extensions of the concept of Young measure is developed to incorporate these complex phenomena in the measure-valued solutions constructed here.Partially supported by N.S.F. GrantPartially supported by N.S.F. Grant 84-0223 and 86-11110 相似文献
35.
The Born scattering approximation has been widely used in seismology to study scattered waves, and to linearize the propagation problem for inversion. The standard Born theory requires the model be separated into a smooth, reference model and a perturbation. Scattering occurs from the pertubation. In the distorted Born approximation, when the reference model is inhomogeneous, the reference Green's functions are normally not known exactly, but the error in these Green's functions is rarely quantified. In this paper, we generalize Born scattering theory to include the errors in the Green's functions explicitly, and obtain scattering integrals from these errors. For forward modelling, there is no need to separate the model into a reference and perturbation part - approximate Green's functions in the true model can be used to calculate the scattered signals.
The theory is developed for inhomogeneous, anisotropic media. Asymptotic ray theory results are suitable approximate Green's functions for the generalized Born scattering theory. The error terms are simple, easily calculated and included in the scattering integrals. Various applications of generalized Born scattering theory have already appeared in the literature, e.g. quasi-shear ray coupling, and this paper is restricted to an improved and more complete theoretical development. Further applications will appear elsewhere. 相似文献
36.
Summary There has been a rapid growth of interest in techniques for site-directed drug design, fuelled by the increasing availability of structural models of proteins of therapeutic importance, and by studies reported in the literature showing that potent chemical leads can be obtained by these techniques. Structure generation programs offer the prospect of discovering highly original lead structures from novel chemical families. Due to the fact that this technique is more-or-less still in its infancy, there are no case studies available that demonstrate the use of structure generation programs for site-directed drug design. Such programs were first proposed in 1986, and became commercially available in early 1992. They have shown their ability to reproduce, or suggest reasonable alternatives for, ligands in well-defined binding sites. This brief review will discuss the recent advances that have been made in the field of site-directed structure generation. 相似文献
37.
38.
39.
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 相似文献
40.
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. 相似文献