全文获取类型
收费全文 | 9111篇 |
免费 | 640篇 |
国内免费 | 509篇 |
专业分类
化学 | 636篇 |
晶体学 | 3篇 |
力学 | 210篇 |
综合类 | 151篇 |
数学 | 8388篇 |
物理学 | 872篇 |
出版年
2024年 | 29篇 |
2023年 | 140篇 |
2022年 | 229篇 |
2021年 | 186篇 |
2020年 | 286篇 |
2019年 | 331篇 |
2018年 | 301篇 |
2017年 | 278篇 |
2016年 | 194篇 |
2015年 | 184篇 |
2014年 | 360篇 |
2013年 | 857篇 |
2012年 | 391篇 |
2011年 | 549篇 |
2010年 | 518篇 |
2009年 | 774篇 |
2008年 | 683篇 |
2007年 | 525篇 |
2006年 | 522篇 |
2005年 | 355篇 |
2004年 | 329篇 |
2003年 | 313篇 |
2002年 | 241篇 |
2001年 | 232篇 |
2000年 | 200篇 |
1999年 | 200篇 |
1998年 | 177篇 |
1997年 | 142篇 |
1996年 | 108篇 |
1995年 | 88篇 |
1994年 | 81篇 |
1993年 | 50篇 |
1992年 | 48篇 |
1991年 | 30篇 |
1990年 | 21篇 |
1989年 | 22篇 |
1988年 | 25篇 |
1987年 | 13篇 |
1985年 | 34篇 |
1984年 | 21篇 |
1983年 | 12篇 |
1982年 | 24篇 |
1981年 | 13篇 |
1980年 | 22篇 |
1978年 | 12篇 |
1977年 | 25篇 |
1976年 | 17篇 |
1975年 | 15篇 |
1974年 | 13篇 |
1973年 | 22篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
强色指数的一个新的上界 总被引:1,自引:0,他引:1
给出了图的强色指数的一个新的上界,并指出几类恰好达到该上界的图,从而改进了Erodoes和Nesetri的强色指数猜想,在某种意义上证明了这个猜想。 相似文献
82.
By Hückel molecular orbital (HMO) theory, the calculation of the total energy of all π-electrons in conjugated hydrocarbons can be reduced to that of E(G)=|λ1|+|λ2|+?+|λn|, where λi are the eigenvalues of the corresponding graph G. Denote by Ψn the set of all fully-angular polyhex chains with n hexagons. In this paper, we show that Hn has the minimum total π-electron energy among chains in Ψn, where Hn is the helicene chain. 相似文献
83.
Jim Foster 《Journal of Combinatorial Theory, Series A》2007,114(8):1515-1525
We show that for an n-gon with unit diameter to have maximum area, its diameter graph must contain a cycle, and we derive an isodiametric theorem for such n-gons in terms of the length of the cycle. We then apply this theorem to prove Graham's 1975 conjecture that the diameter graph of a maximal 2m-gon (m?3) must be a cycle of length 2m−1 with one additional edge attached to it. 相似文献
84.
The aim of this paper is to highlight the added value of the generalized Gouy phase shift introduced by Siegman. Although suited for optical systems study, including those more complex than free space, we note that it did not meet the use that it deserves so far. The analysis of the whole of the ideas and analytical approaches associated to the important concept of the Gouy phase proves its effectiveness.
Usually, the resonance condition is systematically built on the basis of the equivalent empty cavity. Unfortunately, this approach does not cover some of the useful parameters of the real resonator. By means of the generalized Gouy phase and the self-consistent complex parameter q, we derive here a new approach for the calculation of the resonance condition for the real cavity. Moreover, the use of the generalized Gouy phase clearly simplifies the study of resonators, while making it possible to avoid the use of the Huygens’ Fresnel integral. 相似文献
85.
Andreas Fischer 《Mathematical Programming》1997,76(3):513-532
The paper deals with complementarity problems CP(F), where the underlying functionF is assumed to be locally Lipschitzian. Based on a special equivalent reformulation of CP(F) as a system of equationsφ(x)=0 or as the problem of minimizing the merit functionΘ=1/2∥Φ∥
2
2
, we extend results which hold for sufficiently smooth functionsF to the nonsmooth case.
In particular, ifF is monotone in a neighbourhood ofx, it is proved that 0 εδθ(x) is necessary and sufficient forx to be a solution of CP(F). Moreover, for monotone functionsF, a simple derivative-free algorithm that reducesΘ is shown to possess global convergence properties. Finally, the local behaviour of a generalized Newton method is analyzed.
To this end, the result by Mifflin that the composition of semismooth functions is again semismooth is extended top-order semismooth functions. Under a suitable regularity condition and ifF isp-order semismooth the generalized Newton method is shown to be locally well defined and superlinearly convergent with the
order of 1+p. 相似文献
86.
87.
Zhang Shenggui Sun Hao Li Xueliang .Dept.of Appl. Math. Northwestern Polytechnical Univ. Xi''''an China. .Center of Combinatorics Nankai Univ. Tianjin China. 《高校应用数学学报(英文版)》2002,(3)
§ 1 IntroductionAll graphsconsidered in this paperare finite undirected ones withoutloops ormultipleedges.Our terminology and notation are standard exceptas indicated.A good reference forany undefined terms is[1 ] .Let G be a graph with vertex set V( G) and edge set E( G) .The density of G is definedbyd( G) =ε( G)ν( G) ,whereν( G) andε( G) denote| V( G) | and| E( G) | ,respectively.G is said to be balanced iffor each subgraph H of G we have d( H )≤ d( G) ,where V( H ) is assum… 相似文献
88.
1989年发表的Bager第五图,包含关于三角形元素的35个二次规范画数之间的51个不等式通过细致的分析,本文给出了其中遗漏的12个基本不等式 相似文献
89.
侯旻 《新疆大学学报(理工版)》1991,(1)
本文比较了循环图类{c_p(n_1,…,n_p)}和{c-p(n_1…,n_p,p/α)}的直径下界。对于p和α满足一定条件的循环图类{c_p(n_1,n_2,p/α)},本文给出了达到或几乎达到此图类直径下界的一类几乎最优循环图{c_p(m,m+1,p/α)}。 相似文献
90.
Youssef Saab 《Journal of Heuristics》1997,3(3):207-224
A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem. 相似文献