首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6912篇
  免费   579篇
  国内免费   1571篇
化学   3940篇
晶体学   107篇
力学   142篇
综合类   60篇
数学   604篇
物理学   954篇
综合类   3255篇
  2024年   25篇
  2023年   72篇
  2022年   195篇
  2021年   195篇
  2020年   165篇
  2019年   183篇
  2018年   158篇
  2017年   230篇
  2016年   224篇
  2015年   238篇
  2014年   360篇
  2013年   464篇
  2012年   424篇
  2011年   405篇
  2010年   315篇
  2009年   365篇
  2008年   430篇
  2007年   515篇
  2006年   451篇
  2005年   417篇
  2004年   352篇
  2003年   309篇
  2002年   296篇
  2001年   236篇
  2000年   252篇
  1999年   251篇
  1998年   180篇
  1997年   176篇
  1996年   173篇
  1995年   132篇
  1994年   123篇
  1993年   98篇
  1992年   135篇
  1991年   97篇
  1990年   82篇
  1989年   103篇
  1988年   71篇
  1987年   39篇
  1986年   27篇
  1985年   30篇
  1984年   16篇
  1983年   22篇
  1982年   11篇
  1981年   6篇
  1980年   3篇
  1979年   5篇
  1973年   1篇
  1968年   1篇
  1959年   1篇
  1955年   1篇
排序方式: 共有9062条查询结果,搜索用时 15 毫秒
31.
Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences. By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant of a generalized Fourier transform (GFT) becomes particularly simple and fast. Characterizations for finite element triangulations of a symmetric domain are given, and formulas for assembling the block-diagonalized matrix directly are presented. It is emphasized that the GFT preserves symmetric (Hermitian) properties of an equivariant matrix. By simulating the heat equation at the surface of a sphere discretized by an icosahedral grid, it is demonstrated that the block-diagonalization is beneficial. The gain is significant for a direct method, and modest for an iterative method. A comparison with a block-diagonalization approach based upon the continuous formulation is made. It is found that the sparse GFT method is an appropriate way to discretize the resulting continuous subsystems, since the spectrum and the symmetry are preserved. AMS subject classification (2000)  43A30, 65T99, 20B25  相似文献   
32.
A simple microscopic model of charge ordering in the NaxCoO2 system is presented. The model takes into account the interplane interactions between the ordered Na ions and d electrons from the CoO2 layers as well as the nearest-neighbor intraplane Coulomb interactions between d electrons. It is shown that a driving force of charge ordering in the CoO2 layers is the interplane interaction that alone is able to describe various types of inhomogeneous charge ordering (e.g., the striped phases) as well as to predict correctly the conducting properties of the system.  相似文献   
33.
The purpose of this paper is two-fold. First, we introduce a new asymptotic expansion in the exponent for the compound binomial approximation of the generalized Poisson binomial distribution. The dependence of its accuracy on the symmetry and shifting of distributions is investigated. Second, for compound binomial and compound Poisson distributions, we present new smoothness estimates, some of which contain explicit constants. Finally, the ideas used in this paper enable us to prove new precise bounds in the compound Poisson approximation. Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 1, pp. 67–110, January–March, 2006.  相似文献   
34.
由于原子簇化合物在催化,生物活性,功能材料等方面所呈现的重要性,使其成为无机和物理化学最重要的研究领域之一。文章中和谱学方法对一些具有混配体的过渡金属簇合物的结构及其两者之间的关系进行.  相似文献   
35.
提出了一种基于墨西哥帽小波的信号滤波的新方法-MWDA。它是一种化学计量技术,易于操作,被成功地应用到分析化学信号的处理中,MWDA即使处理信噪比为1的高噪声音信号,仍能莸满意的结果。  相似文献   
36.
从中国南海西沙群岛永胜岛附近海域采集到的一种海绵(种属未定)分离到两种新的三羟基长链酰胺类化合物S—Ⅱ(C_(49)H_(99)NO_4,M=765,m.p.138-140℃)和S—Ⅲ(C_(45)H_(93)NO_4,M=723,m.p.92—93℃),通过对它们的IR,MS,~1HNMR,~(13)CNMR及~(13)CNMR DEPT等波谱数据分析,S—Ⅱ和S—Ⅲ的结构分别确定为N-(1-乙基-3,22-二羟基)二十二烷基-2-甲基-4-羟基二十四脂肪酸酰胺和N-(1-羟甲基-2-乙基-4-甲基-3,18-二羟基)十九烷基—二十三脂肪酸酰胺。  相似文献   
37.
The Ramsey number R(G1,G2) of two graphs G1 and G2 is the least integer p so that either a graph G of order p contains a copy of G1 or its complement Gc contains a copy of G2. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory  相似文献   
38.
The results from an experimental study into the dynamic behavior of a gas-liquid medium and solid particles in a compound shell (sphere-truncated cone) are reported on. The following processes are studied: formation of gas bubbles and their clusters, strong macroflows, and intensive chaotic motion of the medium in the truncated cone as a nonlinear vibrating liquid-gas system__________Translated from Prikladnaya Mekhanika, Vol. 41, No. 1, pp. 112–118, January 2005.  相似文献   
39.
一类索赔相关风险模型的破产问题   总被引:2,自引:0,他引:2  
考虑一类索赔相关风险模型的破产问题,得到了罚金折现期望所满足的积分—微分方程。  相似文献   
40.
Sparse approximate inverse (SAI) techniques have recently emerged as a new class of parallel preconditioning techniques for solving large sparse linear systems on high performance computers. The choice of the sparsity pattern of the SAI matrix is probably the most important step in constructing an SAI preconditioner. Both dynamic and static sparsity pattern selection approaches have been proposed by researchers. Through a few numerical experiments, we conduct a comparable study on the properties and performance of the SAI preconditioners using the different sparsity patterns for solving some sparse linear systems. This revised version was published online in July 2006 with corrections to the Cover Date.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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