首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5000篇
  免费   399篇
  国内免费   655篇
化学   99篇
晶体学   2篇
力学   127篇
综合类   84篇
数学   5070篇
物理学   672篇
  2023年   61篇
  2022年   30篇
  2021年   55篇
  2020年   107篇
  2019年   136篇
  2018年   149篇
  2017年   138篇
  2016年   145篇
  2015年   123篇
  2014年   222篇
  2013年   431篇
  2012年   156篇
  2011年   260篇
  2010年   212篇
  2009年   322篇
  2008年   387篇
  2007年   340篇
  2006年   313篇
  2005年   302篇
  2004年   229篇
  2003年   246篇
  2002年   256篇
  2001年   200篇
  2000年   178篇
  1999年   192篇
  1998年   171篇
  1997年   162篇
  1996年   97篇
  1995年   64篇
  1994年   54篇
  1993年   39篇
  1992年   20篇
  1991年   21篇
  1990年   16篇
  1989年   11篇
  1988年   8篇
  1987年   10篇
  1986年   12篇
  1985年   16篇
  1984年   20篇
  1983年   10篇
  1982年   24篇
  1981年   21篇
  1980年   19篇
  1979年   21篇
  1978年   14篇
  1977年   12篇
  1976年   5篇
  1974年   4篇
  1973年   3篇
排序方式: 共有6054条查询结果,搜索用时 125 毫秒
991.
In this study, we introduce the Durrmeyer type Jakimoski–Leviatan operators and examine their approximation properties. We study the local approximation properties of these operators. Further, we investigate the convergence of these operators in a weighted space of functions and obtain the approximation properties. Furthermore, we give a Voronovskaja type theorem for the our new operators. Copyright © 2015 John Wiley & Sons, Ltd.  相似文献   
992.
In this article, we study the approximation of common zeros of non-self inverse strongly monotone operators defined on a closed convex subset C of a Hilbert space H. For a non-self family of operators, we introduce an iterative algorithm without relying on projections. Approximation of common fixed points for finite families of non-self strict pseudo-contractions in the sense of Browder-Petryshyn is also obtained. The novelty of our algorithm is that the coefficients are not given a priori and no assumptions are made on them, but they are constructed step by step in a natural way.  相似文献   
993.
In this article, we give a generalization of the Kantorovich-Szász type operators defined by means of the Brenke type polynomials introduced in the literature and obtain convergence properties of these operators by using Korovkin’s theorem. Some graphical examples using the Maple program for this approximation are given. We also establish the order of convergence by using modulus of smoothness and Peetre’s K-functional and give a Voronoskaja type theorem. In addition, we deal with the convergence of these operators in a weighted space.  相似文献   
994.
In this work we show that if is a linear differential operator of order ν with smooth complex coefficients in from a complex vector space E to a complex vector space F, the Sobolev a priori estimate holds locally at any point if and only if is elliptic and the constant coefficient homogeneous operator is canceling in the sense of Van Schaftingen for every which means that Here is the homogeneous part of order ν of and is the principal symbol of . This result implies and unifies the proofs of several estimates for complexes and pseudo‐complexes of operators of order one or higher proved recently by other methods as well as it extends —in the local setup— the characterization of Van Schaftingen to operators with variable coefficients.  相似文献   
995.
One of the main challenges of fuzzy community detection problems is to be able to measure the quality of a fuzzy partition. In this paper, we present an alternative way of measuring the quality of a fuzzy community detection output based on n-dimensional grouping and overlap functions. Moreover, the proposed modularity measure generalizes the classical Girvan–Newman (GN) modularity for crisp community detection problems and also for crisp overlapping community detection problems. Therefore, it can be used to compare partitions of different nature (i.e. those composed of classical, overlapping and fuzzy communities). Particularly, as is usually done with the GN modularity, the proposed measure may be used to identify the optimal number of communities to be obtained by any network clustering algorithm in a given network. We illustrate this usage by adapting in this way a well-known algorithm for fuzzy community detection problems, extending it to also deal with overlapping community detection problems and produce a ranking of the overlapping nodes. Some computational experiments show the feasibility of the proposed approach to modularity measures through n-dimensional overlap and grouping functions.  相似文献   
996.
997.
We explore the extent to which a variant of a celebrated formula due to Jost and Pais, which reduces the Fredholm perturbation determinant associated with the Schrödinger operator on a half-line to a simple Wronski determinant of appropriate distributional solutions of the underlying Schrödinger equation, generalizes to higher dimensions. In this multi-dimensional extension the half-line is replaced by an open set , , n2, where Ω has a compact, nonempty boundary ∂Ω satisfying certain regularity conditions. Our variant involves ratios of perturbation determinants corresponding to Dirichlet and Neumann boundary conditions on ∂Ω and invokes the corresponding Dirichlet-to-Neumann map. As a result, we succeed in reducing a certain ratio of modified Fredholm perturbation determinants associated with operators in L2(Ω;dnx), , to modified Fredholm determinants associated with operators in L2(∂Ω;dn−1σ), n2. Applications involving the Birman–Schwinger principle and eigenvalue counting functions are discussed.  相似文献   
998.
We characterize the pairs of weights (u,v) such that the geometric mean operator G1, defined for positive functions f on (0,∞) by
  相似文献   
999.
We want to recover a continuous function using only its function values. Let us assume, that f is from the unit ball of some function space (for example a fractional Sobolev space or a Besov space) and the precision of the reconstruction is measured in the norm of another function space of this type. We describe the rate of convergence of the optimal sampling method (linear as well as nonlinear) in this setting.  相似文献   
1000.
The following results for proper quasi‐symmetric designs with non‐zero intersection numbers x,y and λ > 1 are proved.
  • (1) Let D be a quasi‐symmetric design with z = y ? x and v ≥ 2k. If x ≥ 1 + z + z3 then λ < x + 1 + z + z3.
  • (2) Let D be a quasi‐symmetric design with intersection numbers x, y and y ? x = 1. Then D is a design with parameters v = (1 + m) (2 + m)/2, b = (2 + m) (3 + m)/2, r = m + 3, k = m + 1, λ = 2, x = 1, y = 2 and m = 2,3,… or complement of one of these design or D is a design with parameters v = 5, b = 10, r = 6, k = 3, λ = 3, and x = 1, y = 2.
  • (3) Let D be a triangle free quasi‐symmetric design with z = y ? x and v ≥ 2k, then xz + z2.
  • (4) For fixed z ≥ 1 there exist finitely many triangle free quasi‐symmetric designs non‐zero intersection numbers x, y = x + z.
  • (5) There do not exist triangle free quasi‐symmetric designs with non‐zero intersection numbers x, y = x + 2.
© 2006 Wiley Periodicals, Inc. J Combin Designs 15: 49–60, 2007  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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