首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   43946篇
  免费   9655篇
  国内免费   1421篇
化学   46566篇
晶体学   343篇
力学   572篇
综合类   1篇
数学   4010篇
物理学   3530篇
  2021年   166篇
  2020年   1265篇
  2019年   2624篇
  2018年   1037篇
  2017年   671篇
  2016年   3422篇
  2015年   3574篇
  2014年   3504篇
  2013年   4314篇
  2012年   3060篇
  2011年   2257篇
  2010年   2930篇
  2009年   2885篇
  2008年   2529篇
  2007年   1887篇
  2006年   1626篇
  2005年   1775篇
  2004年   1573篇
  2003年   1467篇
  2002年   2130篇
  2001年   1461篇
  2000年   1374篇
  1999年   453篇
  1998年   169篇
  1997年   181篇
  1996年   165篇
  1995年   160篇
  1994年   160篇
  1993年   174篇
  1992年   168篇
  1991年   146篇
  1990年   156篇
  1989年   160篇
  1988年   172篇
  1987年   166篇
  1986年   145篇
  1985年   256篇
  1984年   224篇
  1983年   141篇
  1982年   188篇
  1981年   189篇
  1980年   223篇
  1979年   221篇
  1978年   231篇
  1977年   254篇
  1976年   215篇
  1975年   188篇
  1974年   165篇
  1973年   211篇
  1972年   108篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
141.
This article examines the length of the cycles in the gross domestic product (GDP) real per capita series of 15 countries by means of new statistical techniques based on unit root cycles. We propose tests for unit root cycles at each of the frequencies of the process. Using this approach, we are able to approximate the number of periods per cycle. The results show that the cycles have a periodicity of approximately six years when the disturbances are white noise. However, if we permit autocorrelation, they may also occur at smaller intervals of time. Copyright © 2006 John Wiley & Sons, Ltd.  相似文献   
142.
143.
The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all kN. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications.  相似文献   
144.
An implicit iterative method is applied to solving linear ill‐posed problems with perturbed operators. It is proved that the optimal convergence rate can be obtained after choosing suitable number of iterations. A generalized Morozov's discrepancy principle is proposed for the problems, and then the optimal convergence rate can also be obtained by an a posteriori strategy. The convergence results show that the algorithm is a robust regularization method. Copyright © 2006 John Wiley & Sons, Ltd.  相似文献   
145.
This paper is devoted to the proof of almost global existence results for Klein‐Gordon equations on Zoll manifolds (e.g., spheres of arbitrary dimension) with Hamiltonian nonlinearities, when the Cauchy data are smooth and small. The proof relies on Birkhoff normal form methods and on the specific distribution of eigenvalues of the Laplacian perturbed by a potential on Zoll manifolds. © 2007 Wiley Periodicals, Inc.  相似文献   
146.
Hans Weber 《Order》2007,24(4):249-276
We study lattice theoretical properties of lattices of uniformities such as modularity, distributive laws and the existence of (relative) complements. For this the concepts of permutable uniformities (see Definition 3.1) and independent uniformities (see Definition 4.1) are important. Moreover, we show that e.g. the lattice of all lattice uniformities on a lattice L is a closed sublattice of the lattice of all uniformities on L.  相似文献   
147.
In a structural measurement error model the structural quasi-score (SQS) estimator is based on the distribution of the latent regressor variable. If this distribution is misspecified, the SQS estimator is (asymptotically) biased. Two types of misspecification are considered. Both assume that the statistician erroneously adopts a normal distribution as his model for the regressor distribution. In the first type of misspecification, the true model consists of a mixture of normal distributions which cluster around a single normal distribution, in the second type, the true distribution is a normal distribution admixed with a second normal distribution of low weight. In both cases of misspecification, the bias, of course, tends to zero when the size of misspecification tends to zero. However, in the first case the bias goes to zero in a flat way so that small deviations from the true model lead to a negligible bias, whereas in the second case the bias is noticeable even for small deviations from the true model.  相似文献   
148.
149.
Using ultra-high vacuum scanning tunneling microscopy (UHV-STM), we show that copper-phthalocyanine (CuPc) grows in a well ordered manner on hydrogen passivated vicinal silicon surfaces. CuPc grows one-dimensionally parallel to the monatomic steps on the vicinal silicon surface. Surprisingly, elongated clusters of the CuPc parallel to the step directions are formed even on the middle of the terraces well away from the step edges. The one-dimensional growth mode continues even after the full monolayer coverage on the substrate which results in strongly oriented growth mode of a thin film of CuPc on the vicinal silicon surfaces.  相似文献   
150.
We report the properties of a compact diode-pumped continuous-wave Nd:GdV04 laser with a linear cavity and different Nd-doped laser crystals. In a 0.2at.% Nd-doped Nd:GdVO4 laser, 1.54 W output laser power is achieved at 912nm wavelength with a slope efficiency of 24.8% at an absorbed pump power of 9.4W. With 0.3at.% Nd-doping concentration, we can obtain the either single-wavelength emission at 1064nm or 912nm or the dual-wavelength emission at 1064nm and 912nm by controlling the incident pump power. From an incident pump power of 11.6 W, the 1064nm emission between ^4Fa/2 and ^4I11/2 is suppressed completely by the 912nm emission between ^4Fa/2 and ^4I9/2. We obtain 670 mW output of the 912nm single-wavelength laser emission with a slope efficiency of 5.5% by taking an incident pump power of 18.4 W. Using a Nd:GdV04 laser with 0.4at.% Nd-doping concentration, we obtain either the single-wavelength emission at 1064nm or the dual-wavelength emission at both 1064nm and 912nm by increasing the incident pump power. We observe a strong competition process in the dualavelength laser.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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