首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   320篇
  免费   10篇
  国内免费   10篇
化学   232篇
晶体学   1篇
力学   14篇
数学   53篇
物理学   40篇
  2023年   2篇
  2022年   2篇
  2021年   6篇
  2020年   2篇
  2019年   3篇
  2018年   3篇
  2017年   3篇
  2016年   5篇
  2015年   4篇
  2014年   7篇
  2013年   11篇
  2012年   11篇
  2011年   12篇
  2010年   12篇
  2009年   10篇
  2008年   16篇
  2007年   18篇
  2006年   17篇
  2005年   16篇
  2004年   20篇
  2003年   15篇
  2002年   17篇
  2001年   8篇
  2000年   12篇
  1999年   9篇
  1998年   3篇
  1997年   8篇
  1996年   7篇
  1995年   11篇
  1994年   2篇
  1993年   11篇
  1992年   6篇
  1991年   5篇
  1990年   2篇
  1988年   3篇
  1987年   8篇
  1984年   3篇
  1982年   4篇
  1980年   4篇
  1979年   2篇
  1978年   3篇
  1977年   4篇
  1973年   1篇
  1971年   1篇
  1970年   1篇
  1969年   1篇
  1967年   1篇
  1965年   1篇
  1964年   1篇
  1963年   1篇
排序方式: 共有340条查询结果,搜索用时 15 毫秒
71.
A convergent and highly stereoselective total synthesis of the Z-isomer of cytospolide E has been achieved via Evan’s aldol reaction, Sharpless kinetic resolution and RCM cyclisation.  相似文献   
72.
We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bounds; they depend only on the degree and height of the underlying algebraic sets. We illustrate the use of these results in the context of a modular algorithm.This extends the results by the first and the last author, which were confined to the case of dimension 0. Our strategy is to get back to dimension 0 by evaluation and interpolation techniques. Even though the main tool (height theory) remains the same, new difficulties arise to control the growth of the coefficients during the interpolation process.  相似文献   
73.
The aim of this paper is to present a new analytical resolution to find closure equations of Wohlhart symmetric mechanism and to give some interesting spatial properties of this mechanism. These properties are used to put in evidence possible industrial applications for this type of mechanism. First, it concerns the analytic resolution of the twelve equations system obtained from the closure equation, system particularized for the case of Wohlhart symmetric mechanism. The matrix form of closure equations is written for a single loop overconstrained mechanism composed by six revolute joints, mechanisms called 6R. A kinematical analysis is made, putting in evidence some interesting kinematical and geometrical properties. These properties allow us to consider a new spatial disposition for this mechanism, by imposing three non-successive joints to remain in a determined plan. Thus, we obtain a translator, a possible future industrial application for this type of overconstrained mechanism.  相似文献   
74.
Abstract

In the present study, the two compressibility moduli of a zinc single crystal were measured at room temperature up to 18 GPa. The results are compared with those obtained by Bridgman from a different experimental method. This study required a gaseous hydrostatic confining pressure, and then it has been necessary to develop an original diamond anvil cell with a large optical aperture allowing the use of sophisticated video imaging and image analysis techniques. A model is proposed for the zinc volume-pressure relation.  相似文献   
75.
The model of zero-knowledge multi-prover interactive proofs was introduced by Ben-Or, Goldwasser, Kilian and Wigderson in [4]. A major open problem associated with this model is whether NP problems can be proven by one-round, two-prover, zero-knowledge protocols with exponentially small error probability (e.g. via parallel executions). A positive answer was claimed by Fortnow, Rompel and Sipser in [12], but its proof was later shown to be flawed by Fortnow who demonstrated that the probability of cheating inn independent parallel rounds can be much higher than the probability of cheating inn independent sequential rounds (with exponential ratio between them). In this paper we solve this problem: We show a new one-round two-prover interactive proof for Graph Hamiltonicity, we prove that it is complete, sound and perfect zeroknowledge, and thus every problem in NP has a one-round two-prover interactive proof which is perfectly zero knowledge under no cryptographic assumptions. The main difficulty is in proving the soundness of our parallel protocol namely, proving that the probability of cheating in this one-round protocol is upper bounded by some exponentially low threshold. We prove that this probability is at most 1/2 n/9 (wheren is the number of parallel rounds), by translating the soundness problem into some extremal combinatorial problem, and then solving this new problem.  相似文献   
76.
77.
78.
79.
80.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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