首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5401篇
  免费   425篇
  国内免费   536篇
化学   1839篇
晶体学   17篇
力学   260篇
综合类   95篇
数学   3046篇
物理学   1105篇
  2024年   8篇
  2023年   59篇
  2022年   95篇
  2021年   136篇
  2020年   142篇
  2019年   152篇
  2018年   178篇
  2017年   173篇
  2016年   186篇
  2015年   108篇
  2014年   244篇
  2013年   563篇
  2012年   216篇
  2011年   275篇
  2010年   235篇
  2009年   289篇
  2008年   314篇
  2007年   331篇
  2006年   294篇
  2005年   266篇
  2004年   248篇
  2003年   248篇
  2002年   217篇
  2001年   163篇
  2000年   164篇
  1999年   163篇
  1998年   141篇
  1997年   103篇
  1996年   99篇
  1995年   69篇
  1994年   67篇
  1993年   52篇
  1992年   41篇
  1991年   33篇
  1990年   21篇
  1989年   43篇
  1988年   26篇
  1987年   20篇
  1986年   12篇
  1985年   39篇
  1984年   20篇
  1983年   10篇
  1982年   17篇
  1981年   16篇
  1980年   11篇
  1979年   10篇
  1978年   11篇
  1977年   7篇
  1975年   5篇
  1973年   10篇
排序方式: 共有6362条查询结果,搜索用时 15 毫秒
21.
22.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2.  相似文献   
23.
连通图的离散度是用s(G)来表示的,s(G)=max{ω(G-S)-|S|:ω(G-S)>1,SV(G)}.给出了两个完全图乘积的和一个完全图与路的乘积的离散度.还给出了两个完全图乘积的坚韧度.  相似文献   
24.
The melting behaviour of poly(vinylidene fluoride) (PVDF) was investigated by differential scanning calorimetry (DSC) and small- and wide-angle X-ray scattering in order to study the influence of the chain defects content and of the temperature of annealing on the crystallization and melting behaviour.All the DSC scans show a double endotherm and the analysis of the data suggests that the low temperature endotherm is due to the melting of a population of thin lamellae, whose thickness increases during the annealing, but a high content of chain defects prevents the lamellar thickening and the main effect in this case is the crystallization of thin lamellae from a portion of polymer which did not crystallize during the quenching from the melt. Furthermore, the two melting endotherms, which are observed, can be partially ascribed to a melting-recrystallization process.Furthermore, stepwise isothermal cooling was performed in a differential scanning calorimeter followed by melting scans of fractionated PVDF samples to point out the possible presence of a series of endothermic peaks.  相似文献   
25.
We show that the tensor product B-spline basis and the triangular Bernstein basis are in some sense best conditioned among all nonnegative bases for the spaces of tensor product splines and multivariate polynomials, respectively. We also introduce some new condition numbers which are analogs of component-wise condition numbers for linear systems introduced by Skeel.  相似文献   
26.
Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems.  相似文献   
27.
The superposition relation extended to the statistical operators is shown to be invariant under tensor product and partial trace operations. Particular mathematical examples of superposition are characterized as well as the nature of the Schmidt decomposition of pure states superposition of other pure states.  相似文献   
28.
This paper is devoted to the testing and comparison of numerical solutions obtained from higher-order accurate finite difference schemes for the two-dimensional Burgers' equation having moderate to severe internal gradients. The fourth-order accurate two-point compact scheme, and the fourth-order accurate Du Fort Frankel scheme are derived. The numerical stability and convergence are presented. The cases of shock waves of severe gradient are solved and checked with the fourth-order accurate Du Fort Frankel scheme solutions. The present study shows that the fourth-order two-point compact scheme is highly stable and efficient in comparison with the fourth-order accurate Du Fort Frankel scheme.  相似文献   
29.
The concept of a spectral sequence constructor is generalised to Hopf Galois extensions. The spectral sequence constructions that are given by Guichardet for crossed product algebras are also generalised and shown to provide examples. It is shown that all spectral sequence constructors for Hopf Galois extensions construct the same spectral sequence.  相似文献   
30.
Tensor products of quantum logics and effect algebras with some known problems are reviewed. It is noticed that although tensor products of effect algebras having at least one state exist, in the category of complex Hilbert space effect algebras similar problems as with tensor products of projection lattices occur. Nevertheless, if one of the two coupled physical systems is classical, tensor product exists and can be considered as a Boolean power. Some applications of tensor products (in the form of Boolean powers) to quantum measurements are reviewed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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