首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   19907篇
  免费   1417篇
  国内免费   1490篇
化学   2284篇
晶体学   28篇
力学   840篇
综合类   241篇
数学   6667篇
物理学   2899篇
综合类   9855篇
  2024年   34篇
  2023年   158篇
  2022年   260篇
  2021年   333篇
  2020年   378篇
  2019年   401篇
  2018年   367篇
  2017年   487篇
  2016年   581篇
  2015年   513篇
  2014年   894篇
  2013年   1263篇
  2012年   980篇
  2011年   1118篇
  2010年   965篇
  2009年   1093篇
  2008年   1117篇
  2007年   1350篇
  2006年   1193篇
  2005年   1092篇
  2004年   985篇
  2003年   931篇
  2002年   830篇
  2001年   691篇
  2000年   648篇
  1999年   574篇
  1998年   505篇
  1997年   427篇
  1996年   409篇
  1995年   351篇
  1994年   290篇
  1993年   267篇
  1992年   238篇
  1991年   217篇
  1990年   181篇
  1989年   171篇
  1988年   142篇
  1987年   95篇
  1986年   65篇
  1985年   36篇
  1984年   30篇
  1983年   16篇
  1982年   18篇
  1981年   22篇
  1980年   16篇
  1979年   25篇
  1978年   13篇
  1977年   14篇
  1976年   7篇
  1973年   7篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
941.
The state-of-the-art, large-scale numerical simulations of the scattering problem for the Helmholtz equation in two dimensions rely on iterative solvers for the Lippmann–Schwinger integral equation, with an optimal CPU time O(m 3 log(m)) for an m-by-m wavelength problem. We present a method to solve the same problem directly, as opposed to iteratively, with the obvious advantage in efficiency for multiple right-hand sides corresponding to distinct incident waves. Analytically, this direct method is a hierarchical, recursive scheme consisting of the so-called splitting and merging processes. Algebraically, it amounts to a recursive matrix decomposition, for a cost of O(m 3), of the discretized Lippmann–Schwinger operator. With this matrix decomposition, each back substitution requires only O(m 2 log(m)); therefore, a scattering problem with m incident waves can be solved, altogether, in O(m 3 log(m)) flops.  相似文献   
942.
牛兴文 《大学数学》2002,18(2):85-90
本文对 Jordan标准形定理给出了一种使用初等变换的证明 ,直观意义明显、易于理解 ,可用于线性代数教学 .  相似文献   
943.
Summary For a given fractional 2 m factorial (2 m -FF) designT, the constitution of a block plan to divideT intok (2 r−1<k≦2 r ) blocks withr block factors each at two levels is proposed and investigated. The well-known three norms of the confounding matrix are used as measures for determining a “good” block plan. Some theorems concerning the constitution of a block plan are derived for a 2 m -FF design of odd or even resolution. Two norms which may be preferred over the other norm are slightly modified. For each value ofN assemblies with 11≦N≦26, optimum block plans fork=2 blocks with block sizes [N/2] andN−[N/2] minimizing the two norms are presented forA-optimal balanced 24-FF designs of resolutionV given by Srivastava and Chopra (Technometrics,13, 257–269).  相似文献   
944.
Abstract

Through the modified transfer matrix method, the transmission properties of a one-dimensional coupled-resonator optical waveguide structure composed of metal layers and non-linear material layers is studied. Given proper incident frequency and structure parameters, an optical tri-stability has been achieved. The effect of loss has been considered.  相似文献   
945.
Liping Li 《代数通讯》2018,46(2):615-628
In this paper, we study derived equivalences between triangular matrix algebras using certain classical recollements. We show that special properties of these recollements actually characterize triangular matrix algebras and describe methods to construct tilting modules and tilting complexes inducing derived equivalences between them.  相似文献   
946.
This work is to propose an iterative method of choice to compute a stable subspace of a regular matrix pencil. This approach is to define a sequence of matrix pencils via particular left null spaces. We show that this iteration preserves a semigroup property depending only on the initial matrix pencil. Via this recursion relationship, we propose an accelerated iterative method to compute the stable subspace and use it to provide a theoretical result to solve the principal square root of a given matrix, both nonsingular and singular. We show that this method can not only find out the matrix square root, but also construct an iterative approach which converges to the square root with any desired order.  相似文献   
947.
This paper introduces sampling representations for discrete signals arising from self adjoint difference operators with mixed boundary conditions. The theory of linear operators on finite-dimensional inner product spaces is employed to study the second-order difference operators. We give necessary and sufficient conditions that make the operators self adjoint. The equivalence between the difference operator and a Hermitian Green's matrix is established. Sampling theorems are derived for discrete transforms associated with the difference operator. The results are exhibited via illustrative examples, involving sampling representations for the discrete Hartley transform. Families of discrete fractional Fourier-type transforms are introduced with an application to image encryption.  相似文献   
948.
Integrable couplings of the Boiti-Pempinelli-Tu hierarchy are constructed by a class of non-semisimple block matrix loop algebras. Further, through using the variational identity theory, the Hamiltonian structures of those integrable couplings are obtained. The method can be applied to obtain other integrable hierarchies.  相似文献   
949.
950.
Breaking of ensemble equivalence between the microcanonical ensemble and the canonical ensemble may occur for random graphs whose size tends to infinity, and is signaled by a non-zero specific relative entropy between the two ensembles. In Garlaschelli et al. (2017) and Garlaschelli et al. (0000) it was shown that breaking occurs when the constraint is put on the degree sequence (configuration model). It is not known what is the effect on the relative entropy when the number of constraints is reduced, i.e., when only part of the nodes are constrained in their degree (and the remaining nodes are left unconstrained). Intuitively, the relative entropy is expected to decrease. However, this is not a trivial issue because when constraints are removed both the microcanonical ensemble and the canonical ensemble change. In this paper a formula for the relative entropy valid for generic discrete random structures, recently formulated by Squartini and Garlaschelli, is used to prove that the relative entropy is monotone in the number of constraints when the constraint is on the degrees of the nodes. It is further shown that the expression for the relative entropy corresponds, in the dense regime, to the degrees in the microcanonical ensemble being asymptotically multivariate Dirac and in the canonical ensemble being asymptotically Gaussian.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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