首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   349篇
  免费   7篇
  国内免费   21篇
化学   71篇
力学   7篇
综合类   1篇
数学   246篇
物理学   52篇
  2023年   9篇
  2022年   5篇
  2021年   4篇
  2020年   4篇
  2019年   10篇
  2018年   7篇
  2017年   6篇
  2016年   10篇
  2015年   7篇
  2014年   14篇
  2013年   45篇
  2012年   15篇
  2011年   19篇
  2010年   19篇
  2009年   36篇
  2008年   21篇
  2007年   28篇
  2006年   17篇
  2005年   12篇
  2004年   12篇
  2003年   8篇
  2002年   8篇
  2001年   2篇
  2000年   7篇
  1999年   10篇
  1998年   7篇
  1997年   6篇
  1996年   2篇
  1995年   3篇
  1994年   4篇
  1993年   1篇
  1992年   3篇
  1991年   3篇
  1990年   3篇
  1989年   1篇
  1988年   2篇
  1987年   1篇
  1986年   2篇
  1981年   1篇
  1980年   2篇
  1979年   1篇
排序方式: 共有377条查询结果,搜索用时 15 毫秒
51.
52.
Universal arrays     
《Discrete Mathematics》2021,344(12):112626
  相似文献   
53.
By extending the Levy wavefunction constrained search to Fock Space,one can define a wavefunction constrained search for electron densities in systems having noninteger number of electrons.For pure-state v-representable densities,the results are equivalent to what one would obtain with the zero-temperature grand canonical ensemble.In other cases,the wavefunction constrained search in Fock space presents an upper bound to the grand canonical ensemble functional.One advantage of the Fock-space wavefunction constrained search functional over the zero-temperature grand-canonical ensemble constrained search functional is that certain specific excited states(i.e.,those that are not ground-statev-representable) are the stationary points of the Fock-space functional.However,a potential disadvantage of the Fock-space constrained search functional is that it is not convex.  相似文献   
54.
We prove that there exists a finite universal Korovkin set with respect to positive spectral contraction operators for a Segal algebra on a locally compact abelian groupG if and only ifĜ is finite dimensional separable metrizable space.  相似文献   
55.
In this note we correct a mistake in K-Theory 10 (1996), 49–72. In that paper we asserted that under bootstrap hypotheses the short exact sequence
which arises in the computation ofKK(A,B) (is a split sequence. This is not always the case. ThusKK(A,B) (decomposes into the three components
and
However, this is a decomposition in the sense of composition series, not as three direct summands. The same correction applies to the Milnor sequence. If there is no primepfor which bothK(A) (andK(B) *haveptorsion then the decomposition is indeed as direct summands. The other results of the paper are unaffected.  相似文献   
56.
We derive differential inequalities and difference inequalities for Riesz means of eigenvalues of the Dirichlet Laplacian,
  相似文献   
57.
In this paper, we find all quaternary universal positive definite integral quadratic forms over and prove an analogue of Conway and Schneeberger’s 15-Theorem. This work was partially supported by KRF(2003-070-C00001). This work was supported by the Brain Korea 21 project in 2004.  相似文献   
58.
在将酸碱滴定、络合滴定、氧化还原滴定和沉淀滴定反应统一为M+L=N的基础上,将4种滴定曲线方程统一为两种数学模型。通过简单迭代法计算滴定过程中变化的副反应系数,利用接近数学表达式的自然化语言MATLAB解析4种滴定曲线方程,并绘制出精确的滴定曲线,方法简单易操作。  相似文献   
59.
A new methodology leading to the construction of a universal connection for Fréchet principal bundles is proposed in this paper. The classical theory, applied successfully so far for finite dimensional and Banach modelled bundles, collapses within the framework of Fréchet manifolds. However, based on the replacement of the space of continuous linear mappings by an appropriate topological vector space, we endow the bundle J 1 P of 1-jets of the sections of a Fréchet principal bundle P with a connection form by means of which we may “reproduce” every connection of P.   相似文献   
60.
Given a set S of n points in R3, we wish to decide whether S has a subset of size at least k with Euclidean diameter at most r. It is unknown whether this decision problem is NP-hard. The two closely related optimization problems, (i) finding a largest subset of diameter at most r, and (ii) finding a subset of the smallest diameter of size at least k, were recently considered by Afshani and Chan. For maximizing the size, they presented several polynomial-time algorithms with constant approximation factors, the best of which has a factor of . For maximizing the diameter, they presented a polynomial-time approximation scheme. In this paper, we present improved approximation algorithms for both optimization problems. For maximizing the size, we present two algorithms: the first one improves the approximation factor to 2.5 and the running time by an O(n) factor; the second one improves the approximation factor to 2 and the running time by an O(n2) factor. For minimizing the diameter, we improve the running time of the PTAS from O(nlogn+2O(1/ε3)n) to O(nlogn+2O(1/(ε1.5logε))n).  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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