全文获取类型
收费全文 | 37252篇 |
免费 | 394篇 |
国内免费 | 326篇 |
专业分类
化学 | 16183篇 |
晶体学 | 318篇 |
力学 | 1652篇 |
综合类 | 26篇 |
数学 | 10151篇 |
物理学 | 9642篇 |
出版年
2023年 | 73篇 |
2022年 | 167篇 |
2021年 | 310篇 |
2020年 | 214篇 |
2019年 | 209篇 |
2018年 | 1359篇 |
2017年 | 1613篇 |
2016年 | 1090篇 |
2015年 | 845篇 |
2014年 | 774篇 |
2013年 | 1196篇 |
2012年 | 3628篇 |
2011年 | 2909篇 |
2010年 | 2193篇 |
2009年 | 1926篇 |
2008年 | 1126篇 |
2007年 | 1142篇 |
2006年 | 1023篇 |
2005年 | 4772篇 |
2004年 | 4206篇 |
2003年 | 2548篇 |
2002年 | 691篇 |
2001年 | 436篇 |
2000年 | 240篇 |
1999年 | 266篇 |
1998年 | 209篇 |
1997年 | 131篇 |
1996年 | 137篇 |
1995年 | 119篇 |
1994年 | 103篇 |
1993年 | 90篇 |
1992年 | 235篇 |
1991年 | 204篇 |
1990年 | 183篇 |
1989年 | 145篇 |
1988年 | 130篇 |
1987年 | 82篇 |
1986年 | 74篇 |
1985年 | 91篇 |
1984年 | 65篇 |
1983年 | 55篇 |
1982年 | 46篇 |
1980年 | 47篇 |
1979年 | 50篇 |
1978年 | 50篇 |
1976年 | 99篇 |
1975年 | 57篇 |
1974年 | 54篇 |
1973年 | 61篇 |
1972年 | 49篇 |
排序方式: 共有10000条查询结果,搜索用时 62 毫秒
41.
We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help. 相似文献
42.
We study a 7-dimensional brane world scenario with a Ricci-flat 3-brane residing in the core of a composite monopole defect, i.e., a defect composed of a 't Hooft–Polyakov and a global monopole. Admitting a direct interaction between the two bosonic sectors of the theory, we analyse the structure of the space–time in the limits of small, respectively large direct interaction coupling constant. For large direct interaction, the global monopole disappears from the system and leaves behind a negative cosmological constant in the bulk such that gravity-localising solutions are possible without a priori introduction of a bulk cosmological constant. 相似文献
43.
44.
This paper establishes a link between a generalized matrix Matsumoto-Yor (MY) property and the Wishart distribution. This link highlights certain conditional independence properties within blocks of the Wishart and leads to a new characterization of the Wishart distribution similar to the one recently obtained by Geiger and Heckerman but involving independences for only three pairs of block partitionings of the random matrix.In the process, we obtain two other main results. The first one is an extension of the MY independence property to random matrices of different dimensions. The second result is its converse. It extends previous characterizations of the matrix generalized inverse Gaussian and Wishart seen as a couple of distributions.We present two proofs for the generalized MY property. The first proof relies on a new version of Herz's identity for Bessel functions of matrix arguments. The second proof uses a representation of the MY property through the structure of the Wishart. 相似文献
45.
Daniel Pa?ca 《Journal of Mathematical Analysis and Applications》2007,325(1):90-100
Some existence results are obtained for periodic solutions of nonautonomous second-order differential inclusions systems with p-Laplacian. 相似文献
46.
Sajewicz Mieczysław Hauck Heinz-E. Drabik Gabriela Namysło Ewa Głód Bronisław Kowalska Teresa 《平面色谱法杂志一现代薄层色谱法》2006,19(4):278-281
JPC – Journal of Planar Chromatography – Modern TLC - We have previously described unexpected two-dimensionality in the thin-layer chromatographic separation of pairs of enantiomers of... 相似文献
47.
Goran Pavi? 《Applied Acoustics》2006,67(9):864-881
A method is formulated for the identification of an unknown physical parameter of a fluid-filled pipe using the measurement of sound speed in the pipe. The method uses a simple formula which provides the relationship between the sound speed and a few physical parameters of the pipe: thickness, diameter, wall material constants and fluid constants. Once the sound speed in the pipe is measured, the simple formula can be used to extract one of the unknown parameters providing the remaining ones are known.The sound speed in the pipe is measured using a 3-transducer array. In order to demonstrate the potential of the technique the results of several measurements obtained in a water-filled steel pipe are presented.The required accuracy of the measurement of sound speed and of the specification of known parameters is analysed. The accuracy depends on the unknown parameter which is to be identified. For example, if the pipe thickness is the unknown parameter, the other parameters have to be known within a very narrow margin of error. On the contrary, if the fluid properties have to be identified the needed accuracy of known parameters gets much lower. 相似文献
48.
Rafael R. del Río Castillo 《Communications in Mathematical Physics》1991,142(2):421-431
In this work we study the behavior of embedded eigenvalues of Sturm-Liouville problems in the half axis under local perturbations. When the derivative of the spectral function is strictly positive, we prove that the embedded eigenvalues either disappear or remain fixed. In this case we show that local perturbations cannot add eigenvalues in the continuous spectrum. If the condition on the spectral function is removed then a local perturbation can add infinitely many eigenvalues. 相似文献
49.
A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here. 相似文献
50.
Maria Conceição A. Silva Portela Emmanuel Thanassoulis 《Annals of Operations Research》2006,145(1):129-147
This paper re-assesses three independently developed approaches that are aimed at solving the problem of zero-weights or non-zero
slacks in Data Envelopment Analysis (DEA). The methods are weights restricted, non-radial and extended facet DEA models. Weights
restricted DEA models are dual to envelopment DEA models with restrictions on the dual variables (DEA weights) aimed at avoiding
zero values for those weights; non-radial DEA models are envelopment models which avoid non-zero slacks in the input-output
constraints. Finally, extended facet DEA models recognize that only projections on facets of full dimension correspond to
well defined rates of substitution/transformation between all inputs/outputs which in turn correspond to non-zero weights
in the multiplier version of the DEA model. We demonstrate how these methods are equivalent, not only in their aim but also
in the solutions they yield. In addition, we show that the aforementioned methods modify the production frontier by extending
existing facets or creating unobserved facets. Further we propose a new approach that uses weight restrictions to extend existing
facets. This approach has some advantages in computational terms, because extended facet models normally make use of mixed
integer programming models, which are computationally demanding. 相似文献