首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   38960篇
  免费   465篇
  国内免费   318篇
化学   17348篇
晶体学   325篇
力学   1670篇
综合类   13篇
数学   10403篇
物理学   9984篇
  2023年   89篇
  2022年   290篇
  2021年   377篇
  2020年   258篇
  2019年   264篇
  2018年   1413篇
  2017年   1637篇
  2016年   1156篇
  2015年   884篇
  2014年   851篇
  2013年   1309篇
  2012年   3769篇
  2011年   3019篇
  2010年   2246篇
  2009年   1983篇
  2008年   1172篇
  2007年   1222篇
  2006年   1068篇
  2005年   4844篇
  2004年   4270篇
  2003年   2604篇
  2002年   741篇
  2001年   479篇
  2000年   269篇
  1999年   288篇
  1998年   220篇
  1997年   149篇
  1996年   157篇
  1995年   113篇
  1994年   131篇
  1993年   100篇
  1992年   240篇
  1991年   210篇
  1990年   190篇
  1989年   154篇
  1988年   141篇
  1987年   96篇
  1986年   77篇
  1985年   95篇
  1984年   77篇
  1983年   56篇
  1982年   51篇
  1980年   57篇
  1979年   55篇
  1978年   59篇
  1976年   101篇
  1975年   64篇
  1974年   61篇
  1973年   66篇
  1972年   50篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
Inequalities satisfied by the zeros of the solutions of second-order hypergeometric equations are derived through a systematic use of Liouville transformations together with the application of classical Sturm theorems. This systematic study allows us to improve previously known inequalities and to extend their range of validity as well as to discover inequalities which appear to be new. Among other properties obtained, Szegő's bounds on the zeros of Jacobi polynomials for , are completed with results for the rest of parameter values, Grosjean's inequality (J. Approx. Theory 50 (1987) 84) on the zeros of Legendre polynomials is shown to be valid for Jacobi polynomials with |β|1, bounds on ratios of consecutive zeros of Gauss and confluent hypergeometric functions are derived as well as an inequality involving the geometric mean of zeros of Bessel functions.  相似文献   
42.
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (UbV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.  相似文献   
43.
44.
The standard model on non-commutative space-time   总被引:1,自引:0,他引:1  
We consider the standard model on a non-commutative space and expand the action in the non-commutativity parameter . No new particles are introduced; the structure group is . We derive the leading order action. At zeroth order the action coincides with the ordinary standard model. At leading order in we find new vertices which are absent in the standard model on commutative space-time. The most striking features are couplings between quarks, gluons and electroweak bosons and many new vertices in the charged and neutral currents. We find that parity is violated in non-commutative QCD. The Higgs mechanism can be applied. QED is not deformed in the minimal version of the NCSM to the order considered. Received: 29 November 2001 / Published online: 25 January 2002  相似文献   
45.
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.  相似文献   
46.
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.  相似文献   
47.
Some existence results are obtained for periodic solutions of nonautonomous second-order differential inclusions systems with p-Laplacian.  相似文献   
48.
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...  相似文献   
49.
Chulsu Jo  Y.-R. Jang 《Surface science》2006,600(8):1592-1595
Magnetic properties of Co chain-coated carbon nanotube (CNT) were investigated using a first-principles calculation. Binding energy between Co chain and CNT increased with the coverage ratio, and the adsorption of Co chains on CNT enhanced the conductance channel. Total magnetic moment of Co chains coated on CNT increased with the coverage ratio, while the magnetic moment per Co atom decreased due to spin flip of majority spin states in Co atoms. Spin polarization at the Fermi level of the Co chains was calculated to converge to that of bulk fcc Co.  相似文献   
50.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号