首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   574篇
  免费   19篇
  国内免费   6篇
化学   323篇
晶体学   1篇
力学   9篇
数学   181篇
物理学   85篇
  2023年   2篇
  2022年   5篇
  2021年   16篇
  2020年   4篇
  2019年   11篇
  2018年   16篇
  2017年   18篇
  2016年   20篇
  2015年   25篇
  2014年   19篇
  2013年   36篇
  2012年   39篇
  2011年   28篇
  2010年   28篇
  2009年   16篇
  2008年   32篇
  2007年   31篇
  2006年   19篇
  2005年   22篇
  2004年   23篇
  2003年   16篇
  2002年   16篇
  2001年   10篇
  2000年   7篇
  1999年   5篇
  1998年   7篇
  1997年   10篇
  1996年   12篇
  1995年   11篇
  1994年   5篇
  1993年   2篇
  1992年   12篇
  1991年   5篇
  1990年   15篇
  1989年   5篇
  1988年   7篇
  1987年   5篇
  1986年   3篇
  1985年   5篇
  1984年   5篇
  1983年   4篇
  1982年   2篇
  1980年   2篇
  1979年   2篇
  1978年   2篇
  1973年   3篇
  1957年   2篇
  1956年   2篇
  1954年   1篇
  1953年   1篇
排序方式: 共有599条查询结果,搜索用时 31 毫秒
1.
A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here.  相似文献   
2.
3.
It is shown that if in a simple graph G of order n the sum of degrees of any three pairwise non-adjacent vertices is at least n, then there are two cycles (or one cycle and an edge or a vertex) of GF that contain all the vertices. © 1995 John Wiley & Sons, Inc.  相似文献   
4.
5.
6.
Coloring the vertex set of a graphG with positive integers, thechromatic sum (G) ofG is the minimum sum of colors in a proper coloring. Thestrength ofG is the largest integer that occurs in every coloring whose total is(G). Proving a conjecture of Kubicka and Schwenk, we show that every tree of strengths has at least ((2 + ) s–1 – (2 – ) s–1)/ vertices (s 2). Surprisingly, this extremal result follows from a topological property of trees. Namely, for everys 3 there exist precisely two treesT s andR s such that every tree of strength at leasts is edge-contractible toT s orR s .  相似文献   
7.
Letm 3 andk 1 be two given integers. Asub-k-coloring of [n] = {1, 2,...,n} is an assignment of colors to the numbers of [n] in which each color is used at mostk times. Call an arainbow set if no two of its elements have the same color. Thesub-k-Ramsey number sr(m, k) is defined as the minimumn such that every sub-k-coloring of [n] contains a rainbow arithmetic progression ofm terms. We prove that((k – 1)m 2/logmk) sr(m, k) O((k – 1)m 2 logmk) asm , and apply the same method to improve a previously known upper bound for a problem concerning mappings from [n] to [n] without fixed points.Research supported in part by Allon Fellowship and by a Bat Sheva de-Rothschild grant.Research supported in part by the AKA Research Fund of the Hungarian Academy of Sciences, grant No. 1-3-86-264.  相似文献   
8.
The investigation of the genetic background and phenotype structures of complex diseases, such as cardiovascular or psychiatric disorders and tumors, is one of the most scrutinized fields of the post genomic era. Besides the multiplex analysis of genetic markers and polymorphisms throughout the whole genome, more and more attention is focused on the interaction between the etiological factors of these traits. Haplotype determination, rather than multiplex genotyping seems to be one of the first building blocks of this endeavor. This review focuses on the importance and theoretical background of haplotyping, and summarizes the recent examples of novel and emerging haplotyping techniques by capillary gel electrophoresis based DNA fragment analysis, a powerful tool for the examination of the inheritance of complex traits.  相似文献   
9.
The production cost of cellulolytic enzymes is a major contributor to the high cost of ethanol production from lignocellulosics using enzymatic hydrolysis. The aim of the present study was to investigate the cellulolytic enzyme production ofTrichoderma reesei Rut C 30, which is known as a good cellulase secreting micro-organism, using willow as the carbon source. The willow, which is a fast-growing energy crop in Sweden, was impregnated with 1–4% SO2 and steam-pretreated for 5 min at 206°C. The pretreated willow was washed and the wash water, which contains several soluble sugars from the hemicellulose, was supplemented with fibrous pretreated willow and used for enzyme production. In addition to sugars, the liquid contains degradation products such as acetic acid, furfural, and 5-hydroxy-methylfurfural, which are inhibitory for microorganisms. The results showed that 50% of the cellulose can be replaced with sugars from the wash water. The highest enzyme activity, 1.79 FPU/mL and yield, 133 FPU/g carbohydrate, was obtained at pH 6.0 using 20 g/L carbon source concentration. At lower pHs, a total lack of growth and enzyme production was observed, which probably could be explained by furfural inhibition.  相似文献   
10.
The catinic complex trans-[FeCl(CCHPh)(depe)2]+ (depe = bis(diethylphosphino)ethane has been prepared by interaction of trans-[FeCl2(depe)2] with penylacetylene in methanol solution in the presence of NaX (X = BPh4 or PF6.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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