首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3758篇
  免费   633篇
  国内免费   345篇
化学   507篇
晶体学   88篇
力学   335篇
综合类   40篇
数学   1402篇
物理学   2364篇
  2024年   9篇
  2023年   34篇
  2022年   111篇
  2021年   74篇
  2020年   97篇
  2019年   88篇
  2018年   85篇
  2017年   84篇
  2016年   98篇
  2015年   90篇
  2014年   170篇
  2013年   289篇
  2012年   169篇
  2011年   166篇
  2010年   181篇
  2009年   243篇
  2008年   237篇
  2007年   243篇
  2006年   219篇
  2005年   211篇
  2004年   172篇
  2003年   175篇
  2002年   215篇
  2001年   159篇
  2000年   154篇
  1999年   150篇
  1998年   134篇
  1997年   102篇
  1996年   64篇
  1995年   66篇
  1994年   59篇
  1993年   40篇
  1992年   36篇
  1991年   33篇
  1990年   23篇
  1989年   26篇
  1988年   28篇
  1987年   25篇
  1986年   29篇
  1985年   30篇
  1984年   17篇
  1983年   9篇
  1982年   20篇
  1981年   12篇
  1980年   6篇
  1979年   8篇
  1978年   10篇
  1977年   11篇
  1976年   12篇
  1972年   4篇
排序方式: 共有4736条查询结果,搜索用时 15 毫秒
1.
2.
3.
Hugh Thomas 《Order》2006,23(2-3):249-269
In this paper, we study lattices that posess both the properties of being extremal (in the sense of Markowsky) and of being left modular (in the sense of Blass and Sagan). We call such lattices trim and show that they posess some additional appealing properties, analogous to those of a distributive lattice. For example, trimness is preserved under taking intervals and suitable sublattices. Trim lattices satisfy a weakened form of modularity. The order complex of a trim lattice is contractible or homotopic to a sphere; the latter holds exactly if the maximum element of the lattice is a join of atoms. Any distributive lattice is trim, but trim lattices need not be graded. The main example of ungraded trim lattices are the Tamari lattices and generalizations of them. We show that the Cambrian lattices in types A and B defined by Reading are trim; we conjecture that all Cambrian lattices are trim.  相似文献   
4.
It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   
5.
Sub(L)中的五边形格特征及其数量不等式   总被引:1,自引:0,他引:1  
马占新  赵萃魁 《数学杂志》2002,22(4):459-463
五边形结构在刻画格的特征方面具有十分重要作用,应用格论及组合数学的方法讨论了格L与其子格格Sub(L)中所含五边形格之间的数量关系,给出了有限格L的子格格中三个元生成五边形格的充要条件,同时给出了Sub(L)所含不同五边形格数量的一个下界。  相似文献   
6.
Adustyplasmacanbedefinedasacomplicatedplasmacontainingsmallsolidmattercalleddustgrainsordustparticles,whichareusuallychargednegatively,duetoelectronshighermobilitythanion,bycollectingelectronsandionsfromthebackgroundplasma.Theuniverseisfilledwithdustyplasmassuchasplanetaryrings,comettails,andnebulae.Also,inindustrialplasmaprocessing,particulatessuspendedinplasmaarethemajorcontaminationinsemiconductormanufacture.Studiesondustyplasmahavebeenextendedtofar-flungtopicssuchaswaves,instabilities,stro…  相似文献   
7.
We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

  相似文献   

8.
The Simha and Somcynsky (S–S) statistical thermodynamics theory was used to compute the solubility parameters as a function of temperature and pressure [δ = δ(T, P)], for a series of polymer melts. The characteristic scaling parameters required for this task, P*, T*, and V*, were extracted from the pressure–temperature–volume (PVT) data. To determine the potential polymer–polymer miscibility, the dependence of δ versus T (at ambient pressure) was computed for 17 polymers. Close proximity of the δ versus T curves for four miscible polymer pairs: PPE/PS, PS/PVME, and PC/PMMA signaled the usefulness of this approach. It is noteworthy, that the tabulated solubility parameters (derived from the solution data under ambient conditions) propounded the immiscibility of the PVC/PVAc pair. The computed values of δ also suggested miscibility for polymer pairs of unknown miscibility, namely PPE/PVC, PPE/PVAc, and PET/PSF. In recognizing the limitations of the solubility parameter approach (the omission of several thermodynamic contributions), these preliminary results are auspicious because they indicate a new route for estimating the miscibility of any polymeric material at a given temperature and pressure. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 2909–2915, 2004  相似文献   
9.
10.
王九庆  方守贤 《中国物理 C》1998,22(12):1156-1163
探讨了设计负动量压缩因子(αp<0)的正负电子对撞机储存环磁聚焦结构的可行性及方法.作为应用实例,说明了设计αp<0的τ–粲工厂磁聚焦结构的可能性.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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