首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   34286篇
  免费   1176篇
  国内免费   260篇
化学   23817篇
晶体学   224篇
力学   822篇
数学   5637篇
物理学   5222篇
  2023年   193篇
  2022年   329篇
  2021年   471篇
  2020年   575篇
  2019年   543篇
  2018年   416篇
  2017年   404篇
  2016年   916篇
  2015年   799篇
  2014年   877篇
  2013年   1825篇
  2012年   1975篇
  2011年   2493篇
  2010年   1207篇
  2009年   1094篇
  2008年   2126篇
  2007年   2129篇
  2006年   2097篇
  2005年   1952篇
  2004年   1650篇
  2003年   1420篇
  2002年   1333篇
  2001年   414篇
  2000年   410篇
  1999年   371篇
  1998年   343篇
  1997年   368篇
  1996年   499篇
  1995年   351篇
  1994年   304篇
  1993年   278篇
  1992年   269篇
  1991年   240篇
  1990年   207篇
  1989年   207篇
  1988年   236篇
  1987年   204篇
  1985年   352篇
  1984年   343篇
  1983年   242篇
  1982年   314篇
  1981年   326篇
  1980年   298篇
  1979年   283篇
  1978年   257篇
  1977年   228篇
  1976年   209篇
  1975年   208篇
  1974年   210篇
  1973年   210篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
We give counterexamples to the following conjecture of Auslander: given a finitely generated module M over an Artin algebra Λ, there exists a positive integer nM such that for all finitely generated Λ-modules N, if ExtΛi(M,N)=0 for all i?0, then ExtΛi(M,N)=0 for all i?nM. Some of our examples moreover yield homologically defined classes of commutative local rings strictly between the class of local complete intersections and the class of local Gorenstein rings.  相似文献   
52.
Parametric multiple sequence alignment and phylogeny construction   总被引:1,自引:0,他引:1  
Bounds are given on the size of the parameter-space decomposition induced by multiple sequence alignment problems where phylogenetic information may be given or inferred. It is shown that many of the usual formulations of these problems fall within the same integer parametric framework, implying that the number of distinct optima obtained as the parameters are varied across their ranges is polynomially bounded in the length and number of sequences.  相似文献   
53.
Systematic computation of Stark units over nontotally real base fields is carried out for the first time. Since the information provided by Stark's conjecture is significantly less in this situation than the information provided over totally real base fields, new techniques are required. Precomputing Stark units in relative quadratic extensions (where the conjecture is already known to hold) and coupling this information with the Fincke-Pohst algorithm applied to certain quadratic forms leads to a significant reduction in search time for finding Stark units in larger extensions (where the conjecture is still unproven). Stark's conjecture is verified in each case for these Stark units in larger extensions and explicit generating polynomials for abelian extensions over complex cubic base fields, including Hilbert class fields, are obtained from the minimal polynomials of these new Stark units.

  相似文献   

54.
By optimizing pump power ratio between 1st order backward pump and 2nd order forward pump on discrete Raman amplifier, we demonstrated over 2dB noise figure improvement without excessive non-linearity degradation.  相似文献   
55.
With an explicit example, we confirm a conjecture by Neumann and Wahl that there exist cusps with no Galois cover by a complete intersection. Some computational techniques are reviewed, and a method for deciding whether a given cusp has a complete intersection Galois cover is developed.

  相似文献   

56.
We consider the problem of restructuring an ordered binary tree T, preserving the in-order sequence of its nodes, so as to reduce its height to some target value h. Such a restructuring necessarily involves the downward displacement of some of the nodes of T. Our results, focusing both on the maximum displacement over all nodes and on the maximum displacement over leaves only, provide (i) an explicit tradeoff between the worst-case displacement and the height restriction (including a family of trees that exhibit the worst-case displacements) and (ii) efficient algorithms to achieve height-restricted restructuring while minimizing the maximum node displacement.  相似文献   
57.
For all ‘reasonable’ finite t, k, and s, we construct a t‐(?0, k, 1) design and a group of automorphisms which is transitive on blocks and has s orbits on points. In particular, there is a 2‐(?0, 4, 1) design with a block‐transitive group of automorphisms having two point orbits. This answers a question of P. J. Cameron and C. E. Praeger. The construction is presented in a purely combinatorial way, but is a by‐product of a new way of looking at a model‐theoretic construction of E. Hrushovski. © 2004 Wiley Periodicals, Inc.  相似文献   
58.
We exhibit timelike geodesic paths for a metric, introduced by Bonnor [11] and considered also by Steadman [13], and show that coordinate time runs backward along a portion of these geodesics.  相似文献   
59.
One of the open questions in the geometry of line arrangements is to what extent does the incidence lattice of an arrangement determine its fundamental group. Line arrangements of up to 6 lines were recently classified by K.M. Fan (Michigan Math. J. 44(2) (1997) 283), and it turns out that the incidence lattice of such arrangements determines the projective fundamental group. We use actions on the set of wiring diagrams, introduced in (Garber et al. (J. Knot Theory Ramf.), to classify real arrangements of up to 8 lines. In particular, we show that the incidence lattice of such arrangements determines both the affine and the projective fundamental groups.  相似文献   
60.
Suppose that attached to each site z ∈ ? is a coin with bias θ(z), and only finitely many of these coins have nonzero bias. Allow a simple random walker to generate observations by tossing, at each move, the coin attached to its current position. Then we can determine the biases {θ(z)}z∈?, using only the outcomes of these coin tosses and no information about the path of the random walker, up to a shift and reflection of ?. This generalizes a result of Harris and Keane. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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