首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10950篇
  免费   504篇
  国内免费   2057篇
化学   10057篇
晶体学   185篇
力学   150篇
综合类   90篇
数学   1348篇
物理学   1681篇
  2024年   11篇
  2023年   122篇
  2022年   308篇
  2021年   245篇
  2020年   245篇
  2019年   254篇
  2018年   226篇
  2017年   283篇
  2016年   301篇
  2015年   248篇
  2014年   320篇
  2013年   819篇
  2012年   575篇
  2011年   721篇
  2010年   613篇
  2009年   814篇
  2008年   791篇
  2007年   752篇
  2006年   706篇
  2005年   642篇
  2004年   618篇
  2003年   474篇
  2002年   431篇
  2001年   324篇
  2000年   347篇
  1999年   259篇
  1998年   220篇
  1997年   241篇
  1996年   208篇
  1995年   229篇
  1994年   205篇
  1993年   173篇
  1992年   157篇
  1991年   115篇
  1990年   87篇
  1989年   88篇
  1988年   56篇
  1987年   30篇
  1986年   45篇
  1985年   23篇
  1984年   27篇
  1983年   11篇
  1982年   20篇
  1981年   29篇
  1980年   19篇
  1979年   20篇
  1978年   18篇
  1977年   7篇
  1976年   12篇
  1974年   7篇
排序方式: 共有10000条查询结果,搜索用时 11 毫秒
971.
Let L =△ + V be a SchrSdinger operator in Rd, d ≥ 3, where the nonnegative potential V belongs to the reverse HSlder class Sd. We establish the BMOL-boundedness of Riesz transforms З/ЗxiL-1/2, and give the Fefferman-Stein type decomposition of BMOL functions.  相似文献   
972.
Suppose that X is a closed, symplectic four-manifold with an anti-symplectic involution σ and its two-dimensional fixed point set. We show that the quotient X/σ admits no almost complex structure if .As a partial converse if X is simply-connected and , then the X/σ admits an almost complex structure.Also we show that the quotient X/σ admits an almost complex structure if X is Kähler and .  相似文献   
973.
In this paper we present two different methods for filling in a hole in an explicit 3D surface, defined by a smooth function f in a part of a polygonal domain DR2. We obtain the final reconstructed surface over the whole domain D. We do the filling in two different ways: discontinuous and continuous. In the discontinuous case, we fill the hole with a function in a Powell-Sabin spline space that minimizes a linear combination of the usual seminorms in an adequate Sobolev space, and approximates (in the least squares sense) the values of f and those of its normal derivatives at an adequate set of points. In the continuous case, we will first replace f outside the hole by a smoothing bivariate spline sf, and then we fill the hole also with a Powell-Sabin spline minimizing a linear combination of given seminorms. In both cases, we obtain existence and uniqueness of solutions and we present some graphical examples, and, in the continuous case, we also give a local convergence result.  相似文献   
974.
采用溶剂热合成法,利用T型三羧酸配体3,4',5-联苯三羧酸(H3BPT=biphenyl-3,4',5-tricarboxylicacid)制备并表征了2个2D→3D穿插结构的金属有机框架结构,{[Ni3(BPT)2(bpe)2(H2O)6]·2DMF·7H2O}n(1)和{[Ni3(BPT)2(bpea)2(H2O)6]·2DMF·5H2O}n(2)(bpe=1,2-bis(4-pyridyl)ethylene,bpea=1,2-bis(4-pyridyl)ethane,DMF=N,N-dimethylformamide)。在这2个化合物中,BPT配体和含氮配体bpe或bpea共同连接相邻的Ni(Ⅱ)中心,形成(3,4)-连接的(63)(65.8)二维双层结构。相邻双层结构间相互穿插,形成具有聚轮烷结构的2D→3D互锁结构。气体吸附性质表明,化合物1对CO2和N2具有一定的吸附能力。  相似文献   
975.
We present necessary and sufficient conditions for the existence of a splitting over of the mapping torus of a free group automorphism .  相似文献   
976.
(t,m,s)‐nets are point sets in Euclidean s‐space satisfying certain uniformity conditions, for use in numerical integration. They can be equivalently described in terms of ordered orthogonal arrays, a class of finite geometrical structures generalizing orthogonal arrays. This establishes a link between quasi‐Monte Carlo methods and coding theory. The ambient space is a metric space generalizing the Hamming space of coding theory. We denote it by NRT space (named after Niederreiter, Rosenbloom and Tsfasman). Our main results are generalizations of coding‐theoretic constructions from Hamming space to NRT space. These comprise a version of the Gilbert‐Varshamov bound, the (u,u+υ)‐construction and concatenation. We present a table of the best known parameters of q‐ary (t,m,s)‐nets for qε{2,3,4,5} and dimension m≤50. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 403–418, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10015  相似文献   
977.
We consider a U(1)U(1)-invariant nonlinear Klein–Gordon equation in dimension n?1n?1, self-interacting via the mean field mechanism. We analyze the long-time asymptotics of finite energy solutions and prove that, under certain generic assumptions, each solution converges as t→±∞t± to the two-dimensional set of all “nonlinear eigenfunctions” of the form ?(x)e−iωt?(x)eiωt. This global attraction is caused by the nonlinear energy transfer from lower harmonics to the continuous spectrum and subsequent dispersive radiation.  相似文献   
978.
整体式 Cu-ZSM-5 催化剂上 NH3 选择性催化还原 NO 活性   总被引:3,自引:0,他引:3  
 采用浸渍法制备了一系列不同 Cu 含量的 Cu-ZSM-5 催化剂, 并用于 NH3 选择性催化还原 (SCR)NO 反应. 结果表明, 当 Cu 含量为 8%时, Cu-ZSM-5 催化剂的活性最高; 当空速为 30 000 h–1. , 在 198~440 oC 反应时 NO 转化率均高于 80%, 最高可达 97%, 且空速的影响较小. 经快速水热老化后, 该催化剂活性明显优于商用 V 基催化剂. H2O 和 SO2 对 Cu-ZSM-5 催化剂的 SCR 活性有所影响, 但可明显恢复. X 射线衍射和 NH3 程序升温脱附结果表明, 当 Cu-ZSM-5 中 Cu 含量为 8% 时, 进入 ZSM-5 中阳离子位的 Cu 较多, 催化剂的活性较高, 且其表面具有较多的酸中心和酸量, 从而有利于 SCR 反应.  相似文献   
979.
A graph G is perfect if for all induced subgraphs H of G, . A graph G is Berge if neither G nor its complement contains an induced odd cycle of length at least five. The Strong Perfect Graph Theorem [9] states that a graph is perfect if and only if it is Berge. The Strong Perfect Graph Theorem was obtained as a consequence of a decomposition theorem for Berge graphs [M. Chudnovsky, Berge trigraphs and their applications, PhD thesis, Princeton University, 2003; M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The strong perfect graph theorem, Ann Math 164 (2006), 51–229.], and one of the decompositions in this decomposition theorem was the “balanced skew‐partition.” A clique‐coloring of a graph G is an assignment of colors to the vertices of G in such a way that no inclusion‐wise maximal clique of G of size at least two is monochromatic, and the clique‐chromatic number of G, denoted by , is the smallest number of colors needed to clique‐color G. There exist graphs of arbitrarily large clique‐chromatic number, but it is not known whether the clique‐chromatic number of perfect graphs is bounded. In this article, we prove that every perfect graph that does not admit a balanced skew‐partition is 2‐clique colorable. The main tool used in the proof is a decomposition theorem for “tame Berge trigraphs” due to Chudnovsky et al. ( http://arxiv.org/abs/1308.6444 ).  相似文献   
980.
This paper considers blow-up solutions for reaction-diffusion equations, complemented by homogeneous Dirichlet boundary conditions. It is proved that there exist initial data such that one block or two (separated or contiguous) blocks of n components blow up simultaneously while the others remain bounded. As a corollary, a necessary and sufficient condition is obtained such that any blow-up must be the case for at least two components blowing up simultaneously. We also show some other exponent regions, where any blow-up of k(∈{1,2,…,n}) components must be simultaneous. Moreover, the corresponding blow-up rates and sets are discussed. The results extend those in Liu and Li [B.C. Liu, F.J. Li, Non-simultaneous blow-up of n components for nonlinear parabolic systems, J. Math. Anal. Appl. 356 (2009) 215-231].  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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