首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   19449篇
  免费   414篇
  国内免费   398篇
化学   1810篇
晶体学   65篇
力学   145篇
综合类   22篇
数学   16658篇
物理学   1561篇
  2023年   47篇
  2022年   82篇
  2021年   78篇
  2020年   103篇
  2019年   418篇
  2018年   451篇
  2017年   258篇
  2016年   151篇
  2015年   177篇
  2014年   479篇
  2013年   1384篇
  2012年   678篇
  2011年   944篇
  2010年   817篇
  2009年   1535篇
  2008年   1531篇
  2007年   1398篇
  2006年   921篇
  2005年   667篇
  2004年   606篇
  2003年   618篇
  2002年   717篇
  2001年   761篇
  2000年   739篇
  1999年   845篇
  1998年   722篇
  1997年   471篇
  1996年   382篇
  1995年   427篇
  1994年   398篇
  1993年   278篇
  1992年   194篇
  1991年   88篇
  1990年   54篇
  1989年   52篇
  1988年   54篇
  1987年   47篇
  1986年   36篇
  1985年   70篇
  1984年   88篇
  1983年   62篇
  1982年   72篇
  1981年   71篇
  1980年   53篇
  1979年   48篇
  1978年   52篇
  1977年   42篇
  1976年   26篇
  1975年   25篇
  1974年   17篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
Let X be an algebraic variety defined over a field of characteristic zero, and let ξMax_mult(X) be a point in the closed subset of maximum multiplicity of X. We provide a criterion, given in terms of arcs, to determine whether ξ is isolated in Max_mult(X). More precisely, we use invariants of arcs derived from the Nash multiplicity sequence to characterize when ξ is an isolated point in Max_mult(X).  相似文献   
52.
53.
By referring to theorems of Donaldson and Hitchin, we exhibit a rigorous AdS/CFT-type correspondence between classical 2+1-dimensional vacuum general relativity theory on Σ×RΣ×R and SO(3) Hitchin theory (regarded as a classical conformal field theory) on the spacelike past boundary ΣΣ, a compact, oriented Riemann surface of genus greater than 1. Within this framework we can interpret the 2+1-dimensional vacuum Einstein equation as a decoupled “dual” version of the two-dimensional SO(3) Hitchin equations.  相似文献   
54.
We exhibit a Poisson module restoring a twisted Poincaré duality between Poisson homology and cohomology for the polynomial algebra endowed with Poisson bracket arising from a uniparametrised quantum affine space. This Poisson module is obtained as the semiclassical limit of the dualising bimodule for Hochschild homology of the corresponding quantum affine space. As a corollary we compute the Poisson cohomology of R, and so retrieve a result obtained by direct methods (so completely different from ours) by Monnier. This research of the first author was supported by a Marie Curie Intra-European Fellowship within the 6th European Community Framework Programme. The second author was supported by EPSRC Grant EP/D034167/1.  相似文献   
55.
Scaling symmetry of -type Drinfel’d–Sokolov hierarchy is investigated. Applying similarity reduction to the hierarchy, one can obtain the Schlesinger equation with (n + 1) regular singularities. Especially in the case of n = 3, the hierarchy contains the three-wave resonant system and the similarity reduction gives the generic case of the Painlevé VI equation. We also discuss Weyl group symmetry of the hierarchy.   相似文献   
56.
徐鉴  薛雷平 《力学季刊》2019,40(3):429-436
上海市力学学会成立于1959年9月20日,到今年正好是一个甲子.60个春秋真实写照了上海市力学学会的建立、成长、发展与壮大的过程.60年来,在上海市科协的领导和中国力学学会的指导下,在各团体成员单位的大力支持下,上海市力学学会一代代力学工作者薪火相传、开拓耕耘,历届理事会及下属工作委员会和专业委员会团结奋进、不断创新,广大会员踊跃参与,为上海力学大力发展、力学人才精心培养、力学知识科学普及、力学服务国家发展战略和区域经济建设中做出了重要贡献,学会持续发展壮大.在庆祝力学学会成立六十周年之际,让我们共同抒怀上海力学六十年薪火相传、回顾近10年重要发展,展望上海力学新时代.  相似文献   
57.
The aim of this paper is to present a new classification and regression algorithm based on Artificial Intelligence. The main feature of this algorithm, which will be called Code2Vect, is the nature of the data to treat: qualitative or quantitative and continuous or discrete. Contrary to other artificial intelligence techniques based on the “Big-Data,” this new approach will enable working with a reduced amount of data, within the so-called “Smart Data” paradigm. Moreover, the main purpose of this algorithm is to enable the representation of high-dimensional data and more specifically grouping and visualizing this data according to a given target. For that purpose, the data will be projected into a vectorial space equipped with an appropriate metric, able to group data according to their affinity (with respect to a given output of interest). Furthermore, another application of this algorithm lies on its prediction capability. As it occurs with most common data-mining techniques such as regression trees, by giving an input the output will be inferred, in this case considering the nature of the data formerly described. In order to illustrate its potentialities, two different applications will be addressed, one concerning the representation of high-dimensional and categorical data and another featuring the prediction capabilities of the algorithm.  相似文献   
58.
Summary The ab initio SCF computation of second-order properties of large molecules (with 50 atoms or more) on workstation computers is demonstrated for static dipole polarizabilities and nuclear magneting shieldings. The magnetic shieldings are calculated on the basis of gauge including atomic orbitals (GIAO). Algorithmic advances (semi-direct algorithms with efficient integral pre-screening, and use of a quadratically convergent functional for the polarizabilities) are presented together with an illustrative application to the fullerenes C60 and C70.  相似文献   
59.
We construct an Enriques surface X over Q with empty étale-Brauer set (and hence no rational points) for which there is no algebraic Brauer–Manin obstruction to the Hasse principle. In addition, if there is a transcendental obstruction on X, then we obtain a K3 surface that has a transcendental obstruction to the Hasse principle.  相似文献   
60.
In the first part of this paper we study the convergence of finite difference methods to approximate the maximal solution of problems of the form:u+f (x, u)=0, with boundary conditions eitheru(0)=u(b)=0 oru(0)=u (b)=0, 0<b1. The functionf(x, u) satisfies several conditions that are explicitly given in § 1. This work extends earlier results of Parter (see references at the end).Since this problem has in general more than one solution we develop in the second part two algorithms to approximate solutions characterized by the number of their zeros in (0, 1). We include in the last Section numerical results and some additional comments on the implementation of the algorithms on a digital computer.The research of this author was supported by the Office of Naval Research under contract No N-0014-67-A-0128-004.Part of this research was carried on while this author was visiting the Mathematics Research Center, University of Wisconsin, during the summer of 1969.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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