首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   548262篇
  免费   4625篇
  国内免费   1362篇
化学   269720篇
晶体学   8765篇
力学   26943篇
综合类   16篇
数学   74586篇
物理学   174219篇
  2021年   4115篇
  2020年   4537篇
  2019年   5099篇
  2018年   12689篇
  2017年   13326篇
  2016年   12604篇
  2015年   6320篇
  2014年   9533篇
  2013年   22541篇
  2012年   20037篇
  2011年   29362篇
  2010年   20076篇
  2009年   20087篇
  2008年   25889篇
  2007年   28304篇
  2006年   17020篇
  2005年   19649篇
  2004年   16151篇
  2003年   14769篇
  2002年   13189篇
  2001年   14544篇
  2000年   11108篇
  1999年   8426篇
  1998年   6969篇
  1997年   6783篇
  1996年   6538篇
  1995年   5797篇
  1994年   5635篇
  1993年   5353篇
  1992年   6255篇
  1991年   6370篇
  1990年   6119篇
  1989年   6112篇
  1988年   5874篇
  1987年   5985篇
  1986年   5637篇
  1985年   7203篇
  1984年   7274篇
  1983年   5939篇
  1982年   6125篇
  1981年   5941篇
  1980年   5654篇
  1979年   6205篇
  1978年   6259篇
  1977年   6271篇
  1976年   6144篇
  1975年   5708篇
  1974年   5585篇
  1973年   5648篇
  1972年   3965篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
In the paper the asymptotics for Dirichlet polynomials associated to certain cusp forms are obtained. Partially supported by Lithuanian Foundation of Studies and Science  相似文献   
992.
This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004  相似文献   
993.
994.
The study deals with estimating the reliability of classification algorithms. The present article (the first of three) examines the statistical methods used for point estimation of the reliability of classifiers in the frequency approach. The estimation results are applicable to the small-sample case, which is of considerable importance in practice.  相似文献   
995.
A new quasi-hydrodynamic algorithm is proposed for numerical analysis of convective flows in the presence of a homogeneous external magnetic field. The Marangoni convection problem in a square cross-section cavity is solved.  相似文献   
996.
Preconditioners based on various multilevel extensions of two‐level finite element methods (FEM) lead to iterative methods which have an optimal order computational complexity with respect to the size of the system. Such methods were first presented in Axelsson and Padiy (SIAM. J. Sci. Stat. Comp. 1990; 20 :1807) and Axelsson and Vassilevski (Numer. Math. 1989; 56 :157), and are based on (recursive) two‐level splittings of the finite element space. The key role in the derivation of optimal convergence rate estimates is played by the constant γ in the so‐called Cauchy–Bunyakowski–Schwarz (CBS) inequality, associated with the angle between the two subspaces of the splitting. It turns out that only existence of uniform estimates for this constant is not enough but accurate quantitative bounds for γ have to be found as well. More precisely, the value of the upper bound for γ∈(0,1) is part of the construction of various multilevel extensions of the related two‐level methods. In this paper, an algebraic two‐level preconditioning algorithm for second‐order elliptic boundary value problems is constructed, where the discretization is done using Crouzeix–Raviart non‐conforming linear finite elements on triangles. An important point to make is that in this case the finite element spaces corresponding to two successive levels of mesh refinements are not nested. To handle this, a proper two‐level basis is considered, which enables us to fit the general framework for the construction of two‐level preconditioners for conforming finite elements and to generalize the method to the multilevel case. The major contribution of this paper is the derived estimates of the related constant γ in the strengthened CBS inequality. These estimates are uniform with respect to both coefficient and mesh anisotropy. To our knowledge, the results presented in the paper are the first such estimates for non‐conforming FEM systems. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
997.
998.
We consider a field F that is a direct limit of an increasing chain of finite fields, and describe the Bratteli diagram, complex factor-representations, and projective moduli of the Heisenberg group of 3 × 3 upper-triangular matrices with elements from F. Bibliography: 3 titles.  相似文献   
999.
1000.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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