首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1291篇
  免费   54篇
  国内免费   5篇
化学   915篇
晶体学   8篇
力学   39篇
数学   162篇
物理学   226篇
  2023年   8篇
  2022年   22篇
  2021年   25篇
  2020年   19篇
  2019年   22篇
  2018年   26篇
  2017年   20篇
  2016年   31篇
  2015年   35篇
  2014年   46篇
  2013年   60篇
  2012年   96篇
  2011年   79篇
  2010年   68篇
  2009年   45篇
  2008年   86篇
  2007年   72篇
  2006年   66篇
  2005年   63篇
  2004年   56篇
  2003年   29篇
  2002年   40篇
  2001年   23篇
  2000年   29篇
  1999年   14篇
  1998年   18篇
  1997年   18篇
  1996年   15篇
  1995年   7篇
  1994年   19篇
  1993年   9篇
  1992年   8篇
  1991年   12篇
  1990年   9篇
  1989年   5篇
  1988年   7篇
  1987年   10篇
  1986年   9篇
  1985年   13篇
  1984年   12篇
  1983年   10篇
  1982年   8篇
  1981年   8篇
  1980年   6篇
  1979年   11篇
  1978年   11篇
  1977年   10篇
  1976年   6篇
  1974年   5篇
  1973年   7篇
排序方式: 共有1350条查询结果,搜索用时 171 毫秒
1.
2.
We prove that every five-dimensional simply connected naturally reductive space is weakly symmetric in the sense of A.Selberg [11]. (For dimension less than five it was shown in [1] by a different method). We also show that the converse holds for all dimensions not greater than five.Supported by the grant GACR 201/93/0469Supported by a National Research Project of the M. U. R. S. T (Italy).  相似文献   
3.
4.
This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004  相似文献   
5.
6.
7.
8.
JPC – Journal of Planar Chromatography – Modern TLC - TLC and HPLC have been used for preliminary evaluation of the phenolic acids occurring in the leaves, inflorescences, and rhizomes...  相似文献   
9.
10.
Lithiation of 2,5-dimethylazaferrocene 1 with sec-BuLi/TMEDA in THF at −78 °C proceeds (as shown by quenching with D2O) to comparable extent on the methyl groups and the Cp ring. However, the outcome of the reaction of the lithiated 1 with an electrophile depends on the nature of this electrophile. In the reaction with 4-methoxybenzaldehyde only the product originated from the lateral lithiation is formed, whereas the reaction with 4-methoxyacetophenone and 4,4′-dimethoxybenzophenone afforded mixtures of the products resulting from lateral and ring-lithiation. Similar results were also obtained in the reaction of lithiated 1 with chlorodiphenylphosphine and diphenyl diselenide. On the other hand, the exclusive formation of the Cp-substituted product was observed in the reaction of lithiated 1 with N,N-dimethylformamide. The structures of selected products (oily compounds were transformed into the corresponding crystalline W(CO)5-complexes) were confirmed by X-ray diffraction. The presented reactions open a novel entry to specifically substituted azaferrocenes (especially those containing heteroatom substituents) with potential applications as ligands for the homogenous catalysis.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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