全文获取类型
收费全文 | 435737篇 |
免费 | 19338篇 |
国内免费 | 12632篇 |
专业分类
化学 | 232013篇 |
晶体学 | 6118篇 |
力学 | 22137篇 |
综合类 | 668篇 |
数学 | 62917篇 |
物理学 | 143854篇 |
出版年
2022年 | 4048篇 |
2021年 | 5060篇 |
2020年 | 5831篇 |
2019年 | 5872篇 |
2018年 | 14407篇 |
2017年 | 14899篇 |
2016年 | 12522篇 |
2015年 | 8051篇 |
2014年 | 9726篇 |
2013年 | 18699篇 |
2012年 | 21091篇 |
2011年 | 31199篇 |
2010年 | 19959篇 |
2009年 | 19699篇 |
2008年 | 25720篇 |
2007年 | 28535篇 |
2006年 | 13981篇 |
2005年 | 19133篇 |
2004年 | 13937篇 |
2003年 | 12370篇 |
2002年 | 10077篇 |
2001年 | 9502篇 |
2000年 | 7546篇 |
1999年 | 6262篇 |
1998年 | 5285篇 |
1997年 | 5113篇 |
1996年 | 4977篇 |
1995年 | 4564篇 |
1994年 | 4251篇 |
1993年 | 4055篇 |
1992年 | 4239篇 |
1991年 | 4155篇 |
1990年 | 3842篇 |
1989年 | 3664篇 |
1988年 | 3616篇 |
1987年 | 3437篇 |
1986年 | 3327篇 |
1985年 | 4319篇 |
1984年 | 4427篇 |
1983年 | 3628篇 |
1982年 | 3947篇 |
1981年 | 3795篇 |
1980年 | 3651篇 |
1979年 | 3666篇 |
1978年 | 3900篇 |
1977年 | 3641篇 |
1976年 | 3882篇 |
1975年 | 3450篇 |
1974年 | 3561篇 |
1973年 | 3907篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
941.
Fabio A. C. C. Chalub Peter A. Markowich Benoît Perthame Christian Schmeiser 《Monatshefte für Mathematik》2004,142(1-2):123-141
Kinetic models for chemotaxis, nonlinearly coupled to a Poisson equation for the chemo-attractant density, are considered. Under suitable assumptions on the turning kernel (including models introduced by Othmer, Dunbar and Alt), convergence in the macroscopic limit to a drift-diffusion model is proven. The drift-diffusion models derived in this way include the classical Keller-Segel model. Furthermore, sufficient conditions for kinetic models are given such that finite-time-blow-up does not occur. Examples are given satisfying these conditions, whereas the macroscopic limit problem is known to exhibit finite-time-blow-up. The main analytical tools are entropy techniques for the macroscopic limit as well as results from potential theory for the control of the chemo-attractant density.Present address: Centro de Matemática e Aplicações Fundamentais, Universidade de Lisboa, Av. Prof. Gama Pinto 2, 1649-003, Lisboa, Portugal 相似文献
942.
We prove the existence of solutions to nonlinear free boundary problem with singularities at given points. 相似文献
943.
C. Sparber J. A. Carrillo J. Dolbeault P. A. Markowich 《Monatshefte für Mathematik》2004,141(3):237-257
We analyze the long-time behavior of transport equations for a class of dissipative quantum systems with Fokker-planck type diffusion operator, subject to confining potentials of harmonic oscillator type. We establish the existence and uniqueness of a non-equilibrium steady state for the corresponding dynamics. Further, using a (classical) convex Sobolev inequality, we prove an optimal exponential rate of decay towards this state and additionally give precise dispersion estimates in those cases, where no stationary state exists. 相似文献
944.
A carousel is a dynamical system that describes the movement of an equilateral linkage in which the midpoint of each rod travels parallel to it. They are closely related to the floating body problem. We prove, using the work of Auerbach, that any figure that floats in equilibrium in every position is drawn by a carousel. Of special interest are such figures with rational perimetral density of the floating chords, which are then drawn by carousels. In particular, we prove that for some perimetral densities the only such figure is the circle, as the problem suggests. 相似文献
945.
In the data envelopment analysis (DEA) efficiency literature, qualitative characterizations of returns to scale (increasing, constant, or decreasing) are most common. In economics it is standard to use the scale elasticity as a quantification of scale properties for a production function representing efficient operations. Our contributions are to review DEA practices, apply the concept of scale elasticity from economic multi-output production theory to DEA piecewise linear frontier production functions, and develop formulas for scale elasticity for radial projections of inefficient observations in the relative interior of fully dimensional facets. The formulas are applied to both constructed and real data and show the differences between scale elasticities for the two valid projections (input and output orientations). Instead of getting qualitative measures of returns to scale only as was done earlier in the DEA literature, we now get a quantitative range of scale elasticity values providing more information to policy-makers. 相似文献
946.
We investigate the problem of locating a set of service facilities that need to service customers on a network. To provide service, a server has to visit both the demand node and one of several collection depots. We employ the criterion of minimizing the weighted sum of round trip distances. We prove that there exists a dominating location set for the problem on a general network. The properties of the solution on a tree and on a cycle are discussed. The problem of locating service facilities and collection depots simultaneously is also studied. To solve the problem on a general network, we suggest a Lagrangian relaxation imbedded branch-and-bound algorithm. Computational results are reported. 相似文献
947.
In this paper, we study a problem central to crossdocking that aims to eliminate or minimize storage and order picking activity using JIT scheduling. The problem is modelled naturally as a machine scheduling problem. As the problem is NP-hard, and for real-time applications, we designed and implemented two heuristics. The first uses Squeaky Wheel Optimization embedded in a Genetic Algorithm and the second uses Linear Programming within a Genetic Algorithm. Both heuristics offer good solutions in experiments where comparisons are made with the CPLEX solver. 相似文献
948.
Tracing is a method of assigning flows in an electricity network to particular generators and loads, assuming perfect mixing at each node. It can be used to assign costs to transmission users. We show that the resulting allocation is equal to the Shapley value of an equivalent co-operative game. 相似文献
949.
Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented. 相似文献
950.
In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the
Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead
and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph.
This revised version was published online in September 2006 with corrections to the Cover Date. 相似文献