首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2133篇
  免费   220篇
  国内免费   153篇
化学   408篇
晶体学   12篇
力学   276篇
综合类   47篇
数学   1338篇
物理学   425篇
  2024年   8篇
  2023年   33篇
  2022年   45篇
  2021年   52篇
  2020年   58篇
  2019年   60篇
  2018年   52篇
  2017年   73篇
  2016年   94篇
  2015年   88篇
  2014年   116篇
  2013年   194篇
  2012年   116篇
  2011年   108篇
  2010年   81篇
  2009年   113篇
  2008年   121篇
  2007年   137篇
  2006年   130篇
  2005年   115篇
  2004年   89篇
  2003年   65篇
  2002年   86篇
  2001年   73篇
  2000年   77篇
  1999年   64篇
  1998年   43篇
  1997年   50篇
  1996年   39篇
  1995年   22篇
  1994年   15篇
  1993年   14篇
  1992年   10篇
  1991年   4篇
  1990年   12篇
  1989年   10篇
  1988年   2篇
  1987年   7篇
  1986年   5篇
  1985年   4篇
  1984年   4篇
  1983年   3篇
  1981年   2篇
  1980年   2篇
  1977年   3篇
  1976年   1篇
  1975年   1篇
  1972年   1篇
  1957年   1篇
  1936年   1篇
排序方式: 共有2506条查询结果,搜索用时 15 毫秒
81.
Using the technique of block-operators, in this note, we prove that if P and Q are idempotents and (P - Q)^2n+1 is in the trace class, then (P - Q)^2m+1 is also in the trace class and tr(P - Q)^2m+1 = dim(k(P) ∩ k(Q)^⊥) -dim(k(P)^⊥ N k(Q)), for all m ≥ n. Moreover, we prove that dim(k(P)∩ k(Q)^⊥) = dim(k(P)^⊥ ∩k(Q)) if and only if there exists a unitary U such that UP = QU and PU = UQ, where k(T) denotes the range of T. Keywords Fredholm, orthogonal projection, positive operator  相似文献   
82.
83.
A second-order splitting method is applied to a KdV-like Rosenau equation in one space variable. Then an orthogonal cubic spline collocation procedure is employed to approximate the resulting system. This semidiscrete method yields a system of differential algebraic equations (DAEs) of index 1. Error estimates in L2 and L norms have been obtained for the semidiscrete approximations. For the temporal discretization, the time integrator RADAU5 is used for the resulting system. Some numerical experiments have been conducted to validate the theoretical results and to confirm the qualitative behaviors of the Rosenau equation. Finally, orthogonal cubic spline collocation method is directly applied to BBM (Benjamin–Bona–Mahony) and BBMB (Benjamin–Bona–Mahony–Burgers) equations and the well-known decay estimates are demonstrated for the computed solution. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 695–716, 1998  相似文献   
84.
It is considered the class of Riemann surfaces with dimT1 = 0, where T1 is a subclass of exact harmonic forms which is one of the factors in the orthogonal decomposition of the spaceΩH of harmonic forms of the surface, namely The surfaces in the class OHD and the class of planar surfaces satisfy dimT1 = 0. A.Pfluger posed the question whether there might exist other surfaces outside those two classes. Here it is shown that in the case of finite genus g, we should look for a surface S with dimT1 = 0 among the surfaces of the form Sg\K , where Sg is a closed surface of genus g and K a compact set of positive harmonic measure with perfect components and very irregular boundary.  相似文献   
85.
A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006  相似文献   
86.
A covering array CA(N;t,k,v) is an N × k array such that every N × t sub‐array contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. We introduce a combinatorial technique for their construction, focussing on covering arrays of strength 3 and 4. With a computer search, covering arrays with improved parameters have been found. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 202–213, 2006  相似文献   
87.
88.
We introduce the class of weak amicable T‐matrices and use it to construct a class of orthogonal designs, for p = 1 and for p a prime power ≡ 3 (mod 4), and all odd q, q ≤ 21. This class includes new Plotkin arrays of order 24, 40, 56 and for the first time, of orders 8q, q ∈ {9,11,13,15,17,19,21}. © 2006 Wiley Periodicals, Inc. J Combin Designs 16: 44–52, 2008  相似文献   
89.
设$W_{\beta}(x)=\exp(-\frac{1}{2}|x|^{\beta})~(\beta > 7/6)$ 为Freud权, Freud正交多项式定义为满足下式$\int_{- \infty}^{\infty}p_{n}(x)p_{m}(x)W_{\beta}^{2}(x)\rd x=\left \{ \begin{array}{ll} 0 & \hspace{3mm} n \neq m , \\ 1 & \hspace{3mm}n = m \end{array} \right.$的  相似文献   
90.
It is well known that mutually orthogonal latin squares, or MOLS, admit a (Kronecker) product construction. We show that, under mild conditions, “triple products” of MOLS can result in a gain of one square. In terms of transversal designs, the technique is to use a construction of Rolf Rees twice: once to obtain a coarse resolution of the blocks after one product, and next to reorganize classes and resolve the blocks of the second product. As consequences, we report a few improvements to the MOLS table and obtain a slight strengthening of the famous theorem of MacNeish.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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