首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   429687篇
  免费   2760篇
  国内免费   841篇
化学   201359篇
晶体学   6423篇
力学   23582篇
综合类   11篇
数学   62574篇
物理学   139339篇
  2020年   3250篇
  2019年   3811篇
  2018年   11808篇
  2017年   12418篇
  2016年   10231篇
  2015年   4410篇
  2014年   6651篇
  2013年   15107篇
  2012年   15082篇
  2011年   23571篇
  2010年   15975篇
  2009年   16170篇
  2008年   21182篇
  2007年   24095篇
  2006年   12459篇
  2005年   15745篇
  2004年   12720篇
  2003年   11950篇
  2002年   10453篇
  2001年   10714篇
  2000年   8292篇
  1999年   6193篇
  1998年   5295篇
  1997年   5124篇
  1996年   4863篇
  1995年   4466篇
  1994年   4307篇
  1993年   4185篇
  1992年   4549篇
  1991年   4807篇
  1990年   4661篇
  1989年   4567篇
  1988年   4542篇
  1987年   4522篇
  1986年   4205篇
  1985年   5370篇
  1984年   5656篇
  1983年   4749篇
  1982年   4991篇
  1981年   4882篇
  1980年   4541篇
  1979年   4906篇
  1978年   5156篇
  1977年   5175篇
  1976年   5349篇
  1975年   4925篇
  1974年   4873篇
  1973年   5164篇
  1972年   3698篇
  1971年   3154篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Given a map f: XY and a Nielsen root class, there is a number associated to this root class, which is the minimal number of points among all root classes which are H-related to the given one for all homotopies H of the map f. We show that for maps between closed surfaces it is possible to deform f such that all the Nielsen root classes have cardinality equal to the minimal number if and only if either N R[f]≤1, or N R[f]>1 and f satisfies the Wecken property. Here N R[f] denotes the Nielsen root number. The condition “f satisfies the Wecken property is known to be equivalent to |deg(f)|≤N R[f]/(1−χ(M 2)−χ(M 10/(1−χ(M 2)) for maps between closed orientable surfaces. In the case of nonorientable surfaces the condition is A(f)≤N R[f]/(1−χ(M 2)−χ(M 2)/(1−χ(M 2)). Also we construct, for each integer n≥3, an example of a map f: K n N from an n-dimensionally connected complex of dimension n to an n-dimensional manifold such that we cannot deform f in a way that all the Nielsen root classes reach the minimal number of points at the same time.  相似文献   
992.
Let be a linear subspace of real matrices without rank-one matrices and let be a finite set. Suppose is a bounded arcwise connected Lipschitz domain and is a sequence of bounded vector-valued mappings in such that in as , where is the closed -neighbourhood and the distance function to . We give estimates for such that up to a subsequence, in for some fixed . In other words, we give estimates on such that separates gradient Young measure. The two point set with is a special case of such sets up to a translation. Received: 20 July 2001 / Accepted: 23 January 2002 / Published online: 5 September 2002  相似文献   
993.
We consider some types of packet discretization for continuous spectra in quantum scattering problems. As we previously showed, this discretization leads to a convenient finite-dimensional (i.e., matrix) approximation for integral operators in the scattering theory and allows reducing the solution of singular integral equations connected with the scattering theory to some suitable purely algebraic equations on an analytic basis. All singularities are explicitly singled out. Our primary emphasis is on realizing the method practically.  相似文献   
994.
We prove a Tauberian theorem for Walsh series of two variables, and use it to obtain several results about uniqueness of Cesàro summable double Walsh series. Namely, we show that up to sets of measure zero, Cesàro summability of double Walsh series is the same as convergence of the square dyadic partial sums and, under a suitable growth condition, that uniqueness holds for Cesàro summable double Walsh series.  相似文献   
995.
In this paper we obtain some metrics results about large partial quotients in the continued fraction expansion.  相似文献   
996.
This paper develops a theory for the global solution of nonconvex optimization problems with parameter-embedded linear dynamic systems. A quite general problem formulation is introduced and a solution is shown to exists. A convexity theory for integrals is then developed to construct convex relaxations for utilization in a branch-and-bound framework to calculate a global minimum. Interval analysis is employed to generate bounds on the state variables implied by the bounds on the embedded parameters. These bounds, along with basic integration theory, are used to prove convergence of the branch-and-bound algorithm to the global minimum of the optimization problem. The implementation of the algorithm is then considered and several numerical case studies are examined thoroughly  相似文献   
997.
The European Physical Journal C - We discuss possible searches for the new particles predicted by Little Higgs Models at the LHC. By using a simulation of the ATLAS detector, we demonstrate how the...  相似文献   
998.
A band-dominant function on the Euclidean sphere embedded in R q+1 is the restriction to this sphere of an entire function of q+1 complex variables having a finite exponential type in each of its variables. We develop a method to represent such a function using finitely many bits, using the values of the function at scattered sites on the sphere. The number of bits required in our representation is asymptotically the same as the metric entropy of the class of such functions with respect to any of the L p norms on the sphere.  相似文献   
999.
1000.
The Morse spectrum is a limit set of Lyapunov exponents of periodic pseudo-trajectories. This notion is especially important in the case where a dynamical system has infinitely many periodic trajectories of large period. A method for estimating the Morse spectrum was suggested by the first author in J. Math. Anal. Appl., 252 (2000). This method is based on ideas of symbolic dynamics which reduces the study of a dynamical system to the study of a certain graph, called a symbolic image. Within the framework of this method, the computation of the Morse spectrum is connected with searching simple closed paths and extracting contours with suitable characteristics. However, under iterations of the symbolic image, the number of such paths sharply increases, which leads to huge expenses of memory and time. We suggest an algorithm for constructing contours with the maximal and minimal mean values. This algorithm is based on a special version of the simplex method. Numerical tests are also described. Bibliography: 13 titles. Illustrations: 3 figures.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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