首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   408652篇
  免费   3445篇
  国内免费   976篇
化学   190348篇
晶体学   6455篇
力学   21401篇
综合类   7篇
数学   59979篇
物理学   134883篇
  2021年   3133篇
  2020年   3338篇
  2019年   3774篇
  2018年   11934篇
  2017年   12632篇
  2016年   10530篇
  2015年   4836篇
  2014年   7159篇
  2013年   16055篇
  2012年   15833篇
  2011年   24829篇
  2010年   16854篇
  2009年   16837篇
  2008年   21852篇
  2007年   24640篇
  2006年   12370篇
  2005年   15937篇
  2004年   12550篇
  2003年   11476篇
  2002年   9883篇
  2001年   10531篇
  2000年   7944篇
  1999年   6010篇
  1998年   5016篇
  1997年   4837篇
  1996年   4652篇
  1995年   3971篇
  1994年   3910篇
  1993年   3785篇
  1992年   4171篇
  1991年   4388篇
  1990年   4176篇
  1989年   4086篇
  1988年   3869篇
  1987年   4000篇
  1986年   3760篇
  1985年   4719篇
  1984年   4781篇
  1983年   3982篇
  1982年   4061篇
  1981年   3787篇
  1980年   3740篇
  1979年   4023篇
  1978年   4021篇
  1977年   3939篇
  1976年   3943篇
  1975年   3729篇
  1974年   3665篇
  1973年   3726篇
  1972年   2643篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
Here we prove a limit theorem in the sense of the weak convergence of probability measures in the space of meromorphic functions for a general Dirichlet series. The explicit form of the limit measure in this theorem is given. Partially supported by Lithuanian Foundation of Studies and Science  相似文献   
992.
In the paper the asymptotics for Dirichlet polynomials associated to certain cusp forms are obtained. Partially supported by Lithuanian Foundation of Studies and Science  相似文献   
993.
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  相似文献   
994.
995.
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.  相似文献   
996.
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.  相似文献   
997.
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.  相似文献   
998.
999.
1000.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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