首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   130870篇
  免费   1777篇
  国内免费   488篇
化学   72685篇
晶体学   2148篇
力学   5060篇
综合类   6篇
数学   12889篇
物理学   40347篇
  2016年   1449篇
  2015年   1163篇
  2014年   1503篇
  2013年   5033篇
  2012年   3729篇
  2011年   4791篇
  2010年   2959篇
  2009年   2748篇
  2008年   4280篇
  2007年   4352篇
  2006年   4393篇
  2005年   4281篇
  2004年   3732篇
  2003年   3340篇
  2002年   3260篇
  2001年   3676篇
  2000年   2768篇
  1999年   2265篇
  1998年   1969篇
  1997年   1941篇
  1996年   1898篇
  1995年   1863篇
  1994年   1600篇
  1993年   1594篇
  1992年   1810篇
  1991年   1793篇
  1990年   1732篇
  1989年   1727篇
  1988年   1727篇
  1987年   1718篇
  1986年   1625篇
  1985年   2186篇
  1984年   2303篇
  1983年   1922篇
  1982年   2246篇
  1981年   2073篇
  1980年   2115篇
  1979年   2081篇
  1978年   2214篇
  1977年   2127篇
  1976年   2141篇
  1975年   2075篇
  1974年   1915篇
  1973年   2140篇
  1972年   1300篇
  1971年   995篇
  1970年   917篇
  1969年   932篇
  1968年   1062篇
  1967年   1105篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
When solving large complex optimization problems, the user is faced with three major problems. These are (i) the cost in human time in obtaining accurate expressions for the derivatives involved; (ii) the need to store second derivative information; and (iii), of lessening importance, the time taken to solve the problem on the computer. For many problems, a significant part of the latter can be attributed to solving Newton-like equations. In the algorithm described, the equations are solved using a conjugate direction method that only needs the Hessian at the current point when it is multiplied by a trial vector. In this paper, we present a method that finds this product using automatic differentiation while only requiring vector storage. The method takes advantage of any sparsity in the Hessian matrix and computes exact derivatives. It avoids the complexity of symbolic differentiation, the inaccuracy of numerical differentiation, the labor of finding analytic derivatives, and the need for matrix store. When far from a minimum, an accurate solution to the Newton equations is not justified, so an approximate solution is obtained by using a version of Dembo and Steihaug's truncated Newton algorithm (Ref. 1).This paper was presented at the SIAM National Meeting, Boston, Massachusetts, 1986.  相似文献   
82.
83.
The occurrence and formation of black spots areas in PolyLED devices has been studied by time-of-flight SIMS (TOFSIMS). The composition, shape and position of the black spots is visualised by three-dimensional (3D)-TOFSIMS depth-profiling. It has been established that the formation of non-emissive spots is due to the growth of aluminium oxide clusters at the AlBa/polymer interface. Electron injection in the black spots is lost by the resulting local increase of the resistivity of the cathode.  相似文献   
84.
A model concerning adatom structures is proposed. Attractive nearest neighbour interactions, which may be of electronic nature lead to 2-dimensional condensation. Every pair bond causes and elastic dipole. The elastic dipoles interact via substrate strains with an anisotropics –3 power law. Different types of adatoms or sites are permitted and many-body effects result, from the assumptions. Electric dipole interactions of adatoms are included for comparison. The model is applied to the W(110) surface and compared with superstructures experimentally found in the W(110)-0 system. It is found that there is still lack for an additional next-nearest neighbour interaction.  相似文献   
85.
The timing relationship between a synchronously pumped mode-locked dye laser and its pump laser is explored experimentally and theoretically. The experimental data is in quantitative agreement with numerical solutions of a semiclassical model that includes no free parameters. The data also agrees qualitatively with an approximate, analytic distillation of this model which is presented here for the first time. Our study has a direct bearing on the jitter and the long term stability of these important ultrashort pulse lasers.  相似文献   
86.
87.
An applied cell mapping method for optimal control problems   总被引:1,自引:0,他引:1  
From the application point of view, a series of modifications are proposed for the cell mapping method discussed in Ref. 1 for the optimal control analysis of dynamical systems. The cell order around the target set is rearranged. A set of common discriminate principles is used for the selection of the optimal one among competing control strategies of the same cost. Inequality constraints of the system are taken into account. The number of elements in the set of allowable time intervals is not prescribed, but left open. These modifications seem to make the cell mapping method more efficient for analyzing feedback systems and for obtaining their global optimal control information. The algorithms presented in this paper could broaden the application of the cell mapping approach of Ref. 1 to a wider class of engineering problems.  相似文献   
88.
Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.  相似文献   
89.
A general method for the preparation of diaza-spirocycles is reported. This method used an olefin metathesis in order to construct the desired spirocyclic framework. Beginning with commercially available protected amino ketones, this strategy ultimately produced pharmacologically relevant diaza-scaffolds in an efficient and high-yielding process.  相似文献   
90.
Aspects of Generic Entanglement   总被引:4,自引:4,他引:0  
We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations are quantified by parameters that are subject to the ``concentration of measure' phenomenon, meaning that on a large-probability set these parameters are close to their expectation. For the entropy of entanglement, this has the counterintuitive consequence that there exist large subspaces in which all pure states are close to maximally entangled. This, in turn, implies the existence of mixed states with entanglement of formation near that of a maximally entangled state, but with negligible quantum mutual information and, therefore, negligible distillable entanglement, secret key, and common randomness. It also implies a very strong locking effect for the entanglement of formation: its value can jump from maximal to near zero by tracing over a number of qubits negligible compared to the size of the total system. Furthermore, such properties are generic. Similar phenomena are observed for random multiparty states, leading us to speculate on the possibility that the theory of entanglement is much simplified when restricted to asymptotically generic states. Further consequences of our results include a complete derandomization of the protocol for universal superdense coding of quantum states.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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