首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1074篇
  免费   40篇
  国内免费   7篇
化学   717篇
晶体学   4篇
力学   26篇
数学   169篇
物理学   205篇
  2023年   8篇
  2022年   11篇
  2021年   43篇
  2020年   35篇
  2019年   30篇
  2018年   15篇
  2017年   14篇
  2016年   48篇
  2015年   26篇
  2014年   48篇
  2013年   73篇
  2012年   67篇
  2011年   91篇
  2010年   53篇
  2009年   41篇
  2008年   54篇
  2007年   64篇
  2006年   54篇
  2005年   54篇
  2004年   45篇
  2003年   28篇
  2002年   33篇
  2001年   16篇
  2000年   11篇
  1999年   11篇
  1998年   8篇
  1997年   4篇
  1996年   11篇
  1995年   5篇
  1994年   4篇
  1991年   5篇
  1986年   5篇
  1984年   4篇
  1983年   4篇
  1981年   4篇
  1980年   3篇
  1977年   6篇
  1937年   5篇
  1936年   4篇
  1935年   2篇
  1934年   9篇
  1933年   6篇
  1932年   4篇
  1931年   4篇
  1930年   2篇
  1929年   5篇
  1912年   3篇
  1911年   2篇
  1906年   3篇
  1905年   2篇
排序方式: 共有1121条查询结果,搜索用时 15 毫秒
101.
The InAs quantum structures were formed in silicon by sequential ion implantation and subsequent thermal annealing. Two kinds of crystalline InAs nanostructures were successfully synthesized: nanodots (NDs) and nanopyramids (NPs). The peaks at 215 and 235 cm?1, corresponding to the transverse optical (TO) and longitudinal optical (LO) InAs single-phonon modes, respectively, are clearly visible in the Raman spectra. Moreover, the PL band at around 1.3 µm, due to light emission from InAs NDs with an average diameter 7±2 nm, was observed. The InAs NPs were found only in samples annealed for 20 ms at temperatures ranging from 1000 up to 1200°C. The crystallinity and pyramidal shape of InAs quantum structures were confirmed by HRTEM and XRD techniques. The average size of the NPs is 50 nm base and 50 nm height, and they are oriented parallel to the Si (001) planes. The lattice parameter of the NPs increases from 6.051 to 6.055 Å with the annealing temperature increasing from 1100 to 1200°C, due to lattice relaxation. Energy dispersive spectroscopy (EDS) shows almost stoichiometric composition of the InAs NPs.  相似文献   
102.
103.
We prove that for each universal algebra ${(A, \mathcal{A})}$ of cardinality ${|A| \geq 2}$ and infinite set X of cardinality ${|X| \geq | \mathcal{A}|}$ , the X-th power ${(A^{X}, \mathcal{A}^{X})}$ of the algebra ${(A, \mathcal{A})}$ contains a free subset ${\mathcal{F} \subset A^{X}}$ of cardinality ${|\mathcal{F}| = 2^{|X|}}$ . This generalizes the classical Fichtenholtz–Kantorovitch–Hausdorff result on the existence of an independent family ${\mathcal{I} \subset \mathcal{P}(X)}$ of cardinality ${|\mathcal{I}| = |\mathcal{P}(X)|}$ in the Boolean algebra ${\mathcal{P}(X)}$ of subsets of an infinite set X.  相似文献   
104.
We consider the generalized Stäckel systems, the broadest class of integrable Hamiltonian systems that admit separation of variables and possess separation relations affine in the Hamiltonians. For these systems we construct in a systematic fashion hierarchies of basic separable potentials. Moreover, we show how the equations of motion for the systems under study are related through appropriately chosen reciprocal transformations and how the respective constants of motion are related through generalized Stäckel transforms.  相似文献   
105.
The electrical resistivity and heat conductivity of LuAgCu4 have been studied within the 4.2–300-K range. An additional contribution to heat conductivity, most probably due to the bipolar component, has been revealed at T≥100 K. The conclusion is drawn that LuAgCu4 is apparently a semimetal.  相似文献   
106.
107.
108.
109.
This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation of the capacitated prize-collecting arborescence problem in order to make it solvable in pseudo-polynomial time. Traditional inequalities over the arc formulation, like Capacity Cuts, are also used. Moreover, a novel feature is introduced in such kind of algorithms: powerful new cuts expressed over a very large set of variables are added, without increasing the complexity of the pricing subproblem or the size of the LPs that are actually solved. Computational results on benchmark instances from the OR-Library show very significant improvements over previous algorithms. Several open instances could be solved to optimality.  相似文献   
110.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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