首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   22867篇
  免费   1707篇
  国内免费   1446篇
化学   8941篇
晶体学   231篇
力学   1391篇
综合类   213篇
数学   9385篇
物理学   5859篇
  2023年   215篇
  2022年   481篇
  2021年   486篇
  2020年   575篇
  2019年   579篇
  2018年   555篇
  2017年   583篇
  2016年   641篇
  2015年   536篇
  2014年   871篇
  2013年   1739篇
  2012年   905篇
  2011年   1050篇
  2010年   990篇
  2009年   1331篇
  2008年   1458篇
  2007年   1446篇
  2006年   1248篇
  2005年   1011篇
  2004年   894篇
  2003年   857篇
  2002年   856篇
  2001年   687篇
  2000年   606篇
  1999年   562篇
  1998年   492篇
  1997年   378篇
  1996年   311篇
  1995年   271篇
  1994年   250篇
  1993年   239篇
  1992年   300篇
  1991年   178篇
  1990年   149篇
  1989年   110篇
  1988年   129篇
  1987年   116篇
  1986年   116篇
  1985年   116篇
  1984年   129篇
  1983年   80篇
  1982年   141篇
  1981年   207篇
  1980年   218篇
  1979年   221篇
  1978年   193篇
  1977年   118篇
  1976年   128篇
  1973年   90篇
  1972年   46篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
141.
In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size.  相似文献   
142.
In this article, the comparison of large signal theory and small signal theory has been done with dispersive propagation of optical signal with IMDD (Intensity Modulation Direct Detection) systems for semiconductor lasers with higher-order dispersion terms. The expressions for an exact large signal theory and small signal theory including higher-order dispersion terms for propagation of an optical wave with sinusoidal amplitude and frequency modulation in a dispersive fiber have been derived. It is observed that small signal theory is more sensitive compared to large signal theory in terms of intensity modulation/direct detection systems. Also, it is reported that for large signal analysis the higher-order effects of dispersion can be ignored, whereas for small signal theory, the higher-order effects can be ignored for lower modulation frequencies only. The variation in the transfer function for various values of modulation indices are greater for small signal analysis than for large signal analysis. Also, as the intensity modulation index is increased, there is a decrease in the value of transfer function. The large signal model approximates the small signal model for lower values of the intensity modulation index.  相似文献   
143.
In this paper we study the covariance structure of the number of nodes k and l steps away from the root in random recursive trees. We give an analytic expression valid for all k, l and tree sizes N. The fraction of nodes k steps away from the root is a random probability distribution in k. The expression for the covariances allows us to show that the total variation distance between this (random) probability distribution and its mean converges in probability to zero. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 20: 519–539, 2002  相似文献   
144.
145.
在本文中,我们讨论了非线性常微分方程y"=a0|x|αy3 a1|x|βy2 α2|x|γy α3|x|δ振荡解的渐近表示.在这个方程中将α0,α,α1,β,α2,γ,α3,δ分别换成0,0,6,0,0,0,sgn(x),1就是著名的第一类Painleve方程,而将α0,α,α1,β,α2,γ,α3,δ分别换成2,0,0,0,sgn(x),1,α0,就是著名的第二类Painleve方程.当α0,α,α1,β,α2,γ,α3,δ分别换成-β/3γ,0,0,0,1/γ,1,α,0时,可用于组合KdV方程孤立子解的化简.  相似文献   
146.
In the present investigation, holographic interferometry was utilized for the first time to determine the rate change of the number of the fringe evolutions during the corrosion test of a carbon steel in blank seawater and seawater with different concentrations of a corrosion inhibitor. In other words, the anodic dissolution behaviors (corrosion) of the carbon steel were determined simultaneously by holographic interferometry, as an electromagnetic method, and by the electrochemical impedance (EI) spectroscopy, as an electronic method. So, the abrupt rate change of the number of the fringe evolutions during corrosion tests, EI spectroscopy, of the carbon steel is called electrochemical emission spectroscopy. The corrosion process of the steel samples was carried out in blank seawater and seawater with different concentrations, 5–20 ppm, of TROS C-70 corrosion inhibitor using the EI spectroscopy method, at room temperature. The electrochemical-emission spectra of the carbon steel in different solutions represent a detailed picture of the rate change of the anodic dissolution of the steel throughout the corrosion processes. Furthermore, the optical interferometry data of the carbon steel were compared to the data, which was obtained from the EI. spectroscopy. Consequently, holographic interferometry is found very useful for monitoring the anodic dissolution behaviors of metals, in which the number of the fringe evolutions of the steel samples can be determined in situ.  相似文献   
147.
本文建立了一些关于时滞差分系统(h0,h)稳定性(一致稳定性,渐近稳定性,一致渐近稳定性)的判定准则。在所得到的定理中,去除了△V为常负的限制,特别地,△V甚至可以恒为正,从而大大改进了已有结果,并更加便于应用。  相似文献   
148.
The purpose of this paper is two-fold. First, we introduce a new asymptotic expansion in the exponent for the compound binomial approximation of the generalized Poisson binomial distribution. The dependence of its accuracy on the symmetry and shifting of distributions is investigated. Second, for compound binomial and compound Poisson distributions, we present new smoothness estimates, some of which contain explicit constants. Finally, the ideas used in this paper enable us to prove new precise bounds in the compound Poisson approximation. Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 1, pp. 67–110, January–March, 2006.  相似文献   
149.
By using the Lewis-Riesenfeld theory and algebraic method, we present an alternative approach to obtain the exact solution of time-dependent Hamiltonian systems involving quadratic, inverse quadratic and (1/x)p+p(1/x) terms. This solution is discussed and compared with that obtained by Choi, J. R. (2003). International Journal of Theoretical Physics 42, 853]. PACS: 03.65Ge; 03.65Fd; 03.65Bz  相似文献   
150.
For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?0 disjoint copies of A is referred to as ?0A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?0A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G1, G2,… such that Gi is not a minor of Gj for all ij. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?0A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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