首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1405篇
  免费   45篇
  国内免费   48篇
化学   611篇
晶体学   2篇
力学   51篇
综合类   5篇
数学   292篇
物理学   537篇
  2024年   2篇
  2023年   48篇
  2022年   39篇
  2021年   35篇
  2020年   42篇
  2019年   53篇
  2018年   27篇
  2017年   42篇
  2016年   56篇
  2015年   49篇
  2014年   69篇
  2013年   95篇
  2012年   84篇
  2011年   71篇
  2010年   66篇
  2009年   107篇
  2008年   99篇
  2007年   82篇
  2006年   63篇
  2005年   63篇
  2004年   52篇
  2003年   37篇
  2002年   23篇
  2001年   19篇
  2000年   15篇
  1999年   14篇
  1998年   24篇
  1997年   16篇
  1996年   17篇
  1995年   8篇
  1994年   5篇
  1993年   5篇
  1992年   12篇
  1991年   4篇
  1990年   5篇
  1989年   7篇
  1988年   8篇
  1987年   1篇
  1986年   4篇
  1985年   2篇
  1984年   3篇
  1983年   4篇
  1982年   6篇
  1981年   3篇
  1979年   9篇
  1977年   1篇
  1974年   2篇
排序方式: 共有1498条查询结果,搜索用时 31 毫秒
1.
2.
In this paper, we give new lower bounds for the size of Δ-critical graphs with Δ=8,9 which improve the partial results of Luo [6] and Y. Zhao [12].  相似文献   
3.
Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let ck be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r3=|E|−c3 and . We show that on one side r3 and r2 bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r3 and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr3. For k=2,3, let ζk denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other.  相似文献   
4.
5.
本文分析了利用散斑斑纹检测大输液药品杂质含量的机理,报道了检测大输液药品杂质的实例.  相似文献   
6.
7.
We construct random locally compact real trees called Lévy trees that are the genealogical trees associated with continuous-state branching processes. More precisely, we define a growing family of discrete Galton–Watson trees with i.i.d. exponential branch lengths that is consistent under Bernoulli percolation on leaves; we define the Lévy tree as the limit of this growing family with respect to the Gromov–Hausdorff topology on metric spaces. This elementary approach notably includes supercritical trees and does not make use of the height process introduced by Le Gall and Le Jan to code the genealogy of (sub)critical continuous-state branching processes. We construct the mass measure of Lévy trees and we give a decomposition along the ancestral subtree of a Poisson sampling directed by the mass measure. T. Duquesne is supported by NSF Grants DMS-0203066 and DMS-0405779. M. Winkel is supported by Aon and the Institute of Actuaries, EPSRC Grant GR/T26368/01, le département de mathématique de l’Université d’Orsay and NSF Grant DMS-0405779.  相似文献   
8.
Summary  Thermopiezoelastic materials have recently attracted considerable attention because of their potential use in intelligent or smart structural systems. The governing equations of a thermopiezoelastic medium are more complex due to the intrinsic coupling effects that take place among mechanical, electrical and thermal fields. In this analysis, we deal with the problem of a crack in a semi-infinite, transversely isotropic, thermopiezoelastic material by means of potential functions and Fourier transforms under steady heat-flux loading conditions. The problem is reduced to a singular integral equation that is solved. The thermal stress intensity factor for a crack situated in a cadmium selenide material is calculated. Received 20 March 2001; accepted for publication 18 October 2001  相似文献   
9.
Athanasiadis [Ehrhart polynomials, simplicial polytopes, magic squares and a conjecture of Stanley, J. Reine Angew. Math., to appear.] studies an effective technique to show that Gorenstein sequences coming from compressed polytopes are unimodal. In the present paper we will use such the technique to find a rich class of Gorenstein toric rings with unimodal h-vectors arising from finite graphs.  相似文献   
10.
Given a rectangular array whose entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each color in every column and in every row. The complexity of this problem is still open when there are just three colors in the image. We study some special cases where the number of occurrences of each color is limited to small values. Formulations in terms of edge coloring in graphs and as timetabling problems are used; complexity results are derived from the model.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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