首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   16694篇
  免费   2066篇
  国内免费   1253篇
化学   4148篇
晶体学   102篇
力学   864篇
综合类   285篇
数学   5030篇
物理学   5300篇
无线电   4284篇
  2024年   30篇
  2023年   152篇
  2022年   419篇
  2021年   485篇
  2020年   413篇
  2019年   360篇
  2018年   385篇
  2017年   499篇
  2016年   614篇
  2015年   540篇
  2014年   914篇
  2013年   1105篇
  2012年   955篇
  2011年   1040篇
  2010年   883篇
  2009年   962篇
  2008年   1091篇
  2007年   1078篇
  2006年   951篇
  2005年   919篇
  2004年   729篇
  2003年   685篇
  2002年   634篇
  2001年   469篇
  2000年   474篇
  1999年   415篇
  1998年   406篇
  1997年   343篇
  1996年   300篇
  1995年   237篇
  1994年   245篇
  1993年   170篇
  1992年   147篇
  1991年   118篇
  1990年   98篇
  1989年   104篇
  1988年   86篇
  1987年   71篇
  1986年   52篇
  1985年   77篇
  1984年   53篇
  1983年   37篇
  1982年   53篇
  1981年   27篇
  1980年   27篇
  1979年   32篇
  1978年   33篇
  1977年   21篇
  1976年   20篇
  1973年   14篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
921.
G-protein coupled receptors (GPCRs) play a key role in different biological processes, such as regulation of growth, death and metabolism of cells. They are major therapeutic targets of numerous prescribed drugs. However, the ligand specificity of many receptors is unknown and there is little structural information available. Bioinformatics may offer one approach to bridge the gap between sequence data and functional knowledge of a receptor. In this paper, we use a bagging classification tree algorithm to predict the type of the receptor based on its amino acid composition. The prediction is performed for GPCR at the sub-family and sub-sub-family level. In a cross-validation test, we achieved an overall predictive accuracy of 91.1% for GPCR sub-family classification, and 82.4% for sub-sub-family classification. These results demonstrate the applicability of this relative simple method and its potential for improving prediction accuracy.  相似文献   
922.
Existence of following factorization is proved:
Here A is a stochastic or semi-stochastic (substohastic) d×d matrix (d); I is the unit matrix; B and C are nonnegative, upper and lower triangular matrices. B is a semistochastic matrix; the diagonal entries of C are 1. An exact information on properties of matrices B and C are obtained in particular cases. Some results on existence of invariant distribution x for Markov chains in the cases of absence or presence of sources g of walking particles are obtained using the factorization (F). These problems described by homogeneous or nonhomogeneous equation (IA)x=g.  相似文献   
923.
深沪股市收益率分布特征的统计分析   总被引:8,自引:0,他引:8  
本文通过对深沪两地股票市场的股指收益率数据进行分析,发现两地股票收益率分布均呈现"尖峰厚尾"反正态特征,本文通过引入Laplace分布代替过去人们常用的正态分布去刻画收益率分布,结果显示Laplace分布比正态分布拟合效率有了明显的提高。  相似文献   
924.
Let {B 1 d (t)} and {B d 2(t)} be independent Brownian motions in R d starting from 0 and nx respectively, and let w d i (a,b) ={xR d : B d i (t)=x for some t(a,b)}, i=1,2. Asymptotic expressions as n for the probability of dist(w d 1(n 2 t 1, n 2 t 2), w 2 d (0,n 2 t 3))1 with d4, respectively for the probability of dist(w 1 4(n 2 t 1,n 2 t 2),w 2 4(0,n 2 t 3))1 are obtained. As an application, an improvement of a result due to M. Aizenman concerning the intersections of Wiener sausages in R 4 is presented.  相似文献   
925.
In this paper we first consider a risk process in which claim inter-arrival times and the time untilthe first claim have an Erlang (2) distribution.An explicit solution is derived for the probability of ultimateruin,given an initial reserve of u when the claim size follows a Pareto distribution.Follow Ramsay,Laplacetransforms and exponential integrals are used to derive the solution,which involves a single integral of realvalued functions along the positive real line,and the integrand is not of an oscillating kind.Then we showthat the ultimate ruin probability can be expressed as the sum of expected values of functions of two differentGamma random variables.Finally,the results are extended to the Erlang(n) case.Numerical examples aregiven to illustrate the main results.  相似文献   
926.
Two-Parametric Compound Binomial Approximations   总被引:1,自引:0,他引:1  
We consider two-parametric compound binomial approximation of the generalized Poisson binomial distribution. We show that the accuracy of approximation essentially depends on the symmetry or shifting of distributions and construct asymptotic expansions. For the proofs, we combine the properties of norms with the results for convolutions of symmetric and shifted distributions. In the lattice case, we use the characteristic function method. In the case of almost binomial approximation, we apply Steins method.__________Published in Lietuvos Matematikos Rinkinys, Vol. 44, No. 4, pp. 443–466, October–December, 2004.  相似文献   
927.
We obtain an upper bound for the quantity . Here I is an interval, is the set of rational numbers q=m/n I such that nx, and f(q) is an arbitrary real-valued additive function of rational argument. The interval I and function f may depend on x3.  相似文献   
928.
We consider an arbitrary Riemann surface X, possibly of infinitehyperbolic area. The Liouville measure of the hyperbolic metricdefines a measure on the space of geodesics of the universal covering of X. As we vary the Riemann surface structure,this gives an embedding from the Teichmuller space of X intothe Fréchet space of Hölder distributions on G. We show that the embedding is continuouslydifferentiable. In particular, we obtain an explicit integralrepresentation of the tangent map. 2000 Mathematics SubjectClassification 30F60, 32G15 (primary), 46F99 (secondary).  相似文献   
929.
In his 1961 paper, Marcel Golay showed how the search for pairs of binary sequences of length with complementary autocorrelation is at worst a problem. Andres, in his 1977 master's thesis, developed an algorithm which reduced this to a search and investigated lengths up to 58 for existence of pairs. In this paper, we describe refinements to this algorithm, enabling a search at length 82. We find no new pairs at the outstanding lengths 74 and 82. In extending the theory of composition, we are able to obtain a closed formula for the number of pairs of length generated by a primitive pair of length . Combining this with the results of searches at all allowable lengths up to 100, we identify five primitive pairs. All others pairs of lengths less than 100 may be derived using the methods outlined.

  相似文献   

930.
We derive asymptotic expansions for tails of infinite weighted convolutions of some heavy-tailed distributions. Applications are given to tail expansion of the marginal distribution of ARMA processes, randomly stopped sums, as well as limiting waiting time distribution. AMS 2000 Subject Classifications. Primary—62E99, Secondary—41A60, 44A35, 60G50, 60K25  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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