首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   37393篇
  免费   1364篇
  国内免费   259篇
化学   25872篇
晶体学   277篇
力学   782篇
综合类   1篇
数学   6520篇
物理学   5564篇
  2023年   182篇
  2022年   220篇
  2021年   447篇
  2020年   657篇
  2019年   630篇
  2018年   463篇
  2017年   416篇
  2016年   1000篇
  2015年   898篇
  2014年   1063篇
  2013年   1821篇
  2012年   2298篇
  2011年   2579篇
  2010年   1401篇
  2009年   1245篇
  2008年   2383篇
  2007年   2197篇
  2006年   2220篇
  2005年   2077篇
  2004年   1770篇
  2003年   1447篇
  2002年   1396篇
  2001年   568篇
  2000年   525篇
  1999年   449篇
  1998年   422篇
  1997年   444篇
  1996年   479篇
  1995年   336篇
  1994年   396篇
  1993年   371篇
  1992年   339篇
  1991年   304篇
  1990年   265篇
  1989年   232篇
  1988年   226篇
  1987年   246篇
  1986年   206篇
  1985年   407篇
  1984年   360篇
  1983年   311篇
  1982年   363篇
  1981年   306篇
  1980年   309篇
  1979年   262篇
  1978年   249篇
  1977年   239篇
  1976年   226篇
  1975年   202篇
  1974年   186篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
We show, via a straightforward calculation, that it is feasible to detect nuclear spin echoes in a ferromagnetic thin film by electrical means. The detection scheme is based on the deflection of the electronic magnetization when the nuclear magnetization reforms during an echo. This deflection is observed as a time-dependent magnetoresistive signal.  相似文献   
92.
For a surface F, the Kauffman bracket skein module of F×[0,1], denoted K(F), admits a natural multiplication which makes it an algebra. When specialized at a complex number t, nonzero and not a root of unity, we have Kt(F), a vector space over C. In this paper, we will use the product-to-sum formula of Frohman and Gelca to show that the vector space Kt(T2) has five distinct traces. One trace, the Yang-Mills measure, is obtained by picking off the coefficient of the empty skein. The other four traces on Kt(T2) correspond to the four singular points of the moduli space of flat SU(2)-connections on the torus.  相似文献   
93.
One can form a polygonal linkage by identifying initial and terminal points of two free linkages. Likewise, one can form a multipolygonal linkage by identifying initial and terminal points of three free linkages. The geometric and topological properties of moduli spaces of multipolygonal linkages in the plane are studied. These spaces are compact algebraic varieties. Some conditions under which these spaces are smooth manifolds, cross products or disjoint unions of moduli spaces of polygonal linkages, or connected, are determined. Dimensions in smooth manifold cases and some Euler characteristics are computed. A classification of generic multiquadrilateral linkages is also made.  相似文献   
94.
We propose a new approach towards proving that the fixed point property for ordered sets is preserved by products. This approach uses a characterization of fixed points in products via isotone relations. First explorations of classes of isotone relations are presented. These first explorations give us hope that this approach could lead to advances on the Product Problem.  相似文献   
95.
An algorithm is described that determines whether a given polynomial with integer coefficients has a cyclotomic factor. The algorithm is intended to be used for sparse polynomials given as a sequence of coefficient-exponent pairs. A running analysis shows that, for a fixed number of nonzero terms, the algorithm runs in polynomial time.

  相似文献   

96.
This paper presents a new generic Evolutionary Algorithm (EA) for retarding the unwanted effects of premature convergence. This is accomplished by a combination of interacting generic methods. These generalizations of a Genetic Algorithm (GA) are inspired by population genetics and take advantage of the interactions between genetic drift and migration. In this regard a new selection scheme is introduced, which is designed to directedly control genetic drift within the population by advantageous self-adaptive selection pressure steering. Additionally this new selection model enables a quite intuitive heuristics to detect premature convergence. Based upon this newly postulated basic principle the new selection mechanism is combined with the already proposed Segregative Genetic Algorithm (SEGA), an advanced Genetic Algorithm (GA) that introduces parallelism mainly to improve global solution quality. As a whole, a new generic evolutionary algorithm (SASEGASA) is introduced. The performance of the algorithm is evaluated on a set of characteristic benchmark problems. Computational results show that the new method is capable of producing highest quality solutions without any problem-specific additions.  相似文献   
97.
In this paper we present different inversion algorithms for nonlinear ill-posed problems arising in atmosphere remote sensing. The proposed methods are Landweber's method (LwM), the iteratively regularized Gauss-Newton method, and the conventional and regularizing Levenberg-Marquardt method. In addition, some accelerated LwMs and a technique for smoothing the Levenberg-Marquardt solution are proposed. The numerical performance of the methods is studied by means of simulations. Results are presented for an inverse problem in atmospheric remote sensing, i.e., temperature sounding with an airborne uplooking high-resolution far-infrared spectrometer.  相似文献   
98.
We determine the stationary two-point correlation function of the one-dimensional KPZ equation through the scaling limit of a solvable microscopic model, the polynuclear growth model. The equivalence to a directed polymer problem with specific boundary conditions allows one to express the corresponding scaling function in terms of the solution to a Riemann–Hilbert problem related to the Painlevé II equation. We solve these equations numerically with very high precision and compare our, up to numerical rounding exact, result with the prediction of Colaiori and Moore(1) obtained from the mode coupling approximation.  相似文献   
99.
100.
The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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