全文获取类型
收费全文 | 7724篇 |
免费 | 1169篇 |
国内免费 | 573篇 |
专业分类
化学 | 1291篇 |
晶体学 | 21篇 |
力学 | 297篇 |
综合类 | 103篇 |
数学 | 2257篇 |
物理学 | 2067篇 |
无线电 | 3430篇 |
出版年
2024年 | 45篇 |
2023年 | 141篇 |
2022年 | 280篇 |
2021年 | 310篇 |
2020年 | 271篇 |
2019年 | 229篇 |
2018年 | 217篇 |
2017年 | 298篇 |
2016年 | 315篇 |
2015年 | 347篇 |
2014年 | 545篇 |
2013年 | 555篇 |
2012年 | 464篇 |
2011年 | 523篇 |
2010年 | 407篇 |
2009年 | 457篇 |
2008年 | 539篇 |
2007年 | 509篇 |
2006年 | 471篇 |
2005年 | 393篇 |
2004年 | 339篇 |
2003年 | 282篇 |
2002年 | 232篇 |
2001年 | 191篇 |
2000年 | 190篇 |
1999年 | 192篇 |
1998年 | 141篇 |
1997年 | 110篇 |
1996年 | 105篇 |
1995年 | 65篇 |
1994年 | 62篇 |
1993年 | 41篇 |
1992年 | 30篇 |
1991年 | 19篇 |
1990年 | 19篇 |
1989年 | 23篇 |
1988年 | 8篇 |
1987年 | 9篇 |
1986年 | 17篇 |
1985年 | 8篇 |
1984年 | 10篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 8篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1978年 | 5篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1973年 | 4篇 |
排序方式: 共有9466条查询结果,搜索用时 15 毫秒
41.
We introduce and study a new class of Ramsey-Turán problems, a typical example of which is the following one:Let ε>0 and G be a graph of sufficiently large order n with minimum degree δ(G)>3n/4. If the edges of G are colored in blue or red, then for all k∈[4,⌊(1/8−ε)n⌋], there exists a monochromatic cycle of length k. 相似文献
42.
The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering arrays (equivalently, surjective codes with a radius) has been determined precisely only in special cases. In this paper, explicit constructions for numerous best known covering arrays (upper bounds) are found by a combination of combinatorial and computational methods. For radius-covering arrays, explicit constructions from covering codes are developed. Lower bounds are improved upon using connections to orthogonal arrays, partition matrices, and covering codes, and in specific cases by computation. Consequently for some parameter sets the minimum size of a covering array is determined precisely. For some of these, a complete classification of all inequivalent covering arrays is determined, again using computational techniques. Existence tables for up to 10 columns, up to 8 symbols, and all possible strengths are presented to report the best current lower and upper bounds, and classifications of inequivalent arrays. 相似文献
43.
44.
Alexander Moretó 《Algebras and Representation Theory》2007,10(4):333-338
Given a group G, Γ(G) is the graph whose vertices are the primes that divide the degree of some irreducible character and two vertices p and q are joined by an edge if pq divides the degree of some irreducible character of G. By a definition of Lewis, a graph Γ has bounded Fitting height if the Fitting height of any solvable group G with Γ(G)=Γ is bounded (in terms of Γ). In this note, we prove that there exists a universal constant C such that if Γ has bounded Fitting height and Γ(G)=Γ then h(G)≤C. This solves a problem raised by Lewis.
Research supported by the Spanish Ministerio de Educación y Ciencia, MTM2004-06067-C02-01 and MTM2004-04665, the FEDER and
Programa Ramón y Cajal. 相似文献
45.
We prove the following result concerning the degree spectrum of the atom relation on a computable Boolean algebra. Let be a computable Boolean algebra with infinitely many atoms and be the Turing degree of the atom relation of . If is a c.e. degree such that , then there is a computable copy of where the atom relation has degree . In particular, for every c.e. degree , any computable Boolean algebra with infinitely many atoms has a computable copy where the atom relation has degree .
46.
Valeriy K. Bulitko 《Mathematical Logic Quarterly》2002,48(3):367-373
In this paper we consider the we known method by E. Post of solving the problem of construction of recursively enumerable sets that have a degree intermediate between the degrees of recursive and complete sets with respect to a given reducibility. Post considered reducibilities ≤m, ≤btt, ≤tt and ≤T and solved the problem for al of them except ≤T. Here we extend Post's original method of construction of incomplete sets onto two wide classes of sub‐Turing reducibilities what were studying in [1, 2]. 相似文献
47.
By coincidence degree,the existence of solution to the boundary value problem of a generalized Liénard equation a(t)x"+F(x,x′)x′+g(x)=e(t),x(0)=x(2π),x′(0)=x′(2π)is proved,where a∈C1[0,2π],a(t)>0(0≤t≤2π),a(0)=a(2π),F(x,y)=f(x)+α| y|β,α>0,β>0 are all constants,f∈C(R,R),e∈C[0,2π]. An example is given as an application. 相似文献
48.
基于高功率激光装置对脉冲氙灯工程运行可靠性的要求,利用现有的能源模块开展了氙灯放电考核实验。实验结果表明:虽然氙灯运行在安全的能量负载水平,当能源模块单个放电回路的峰值功率超过300 MW时,氙灯石英玻璃管壁存在热损伤风险。肉眼观察到管壁损伤后在反射器对侧的灯管内壁出现乳白色沉积层。经扫描电镜和X射线光电子能谱测试分析,证实热损伤形成的乳白色沉积物为二氧化硅。为探究管壁热损伤机制,采用高速摄影观测了氙灯放电等离子体沟道发展过程。图像显示放大器内金属反射器的几何形状对放电沟道的分布产生了显著影响,尤其是在侧灯箱,灯内电弧沟道会靠近反射器一侧集中分布,因此,导致等离子体对灯管的偏烧。当放电峰值功率超过石英热负载极限时,管壁表面二氧化硅材料会被烧蚀至蒸发、气化,并随后沉积在灯管较冷部位。研究结果表明放电回路的放电峰值功率过高、放大器内金属反射器均会对氙灯造成热损伤。 相似文献
49.
S. Barry Cooper 《Mathematical Logic Quarterly》2001,47(1):3-33
A proof is given that 0 ′ (the argest Turing degree containing a computably enumerable set) is definable in the structure of the degrees of unsolvability. This answers a long‐standing question of Kleene and Post, and has a number of corollaries including the definability of the jump operator. 相似文献
50.
Liliana GRATIE 《数学年刊B辑(英文版)》2000,21(2):147-152
gi.TheTOpologicalDegreeforGeneralizedMonotoneOperatorsMonotoneoperatortheoryisoftenanefficienttoolforprovingtheexistenceofsolutionstononlinearProblems.Inparticular,thepseudo-monotoneoperatorsintroducedbyBrezis[2]areveryusefulforstudyingnonlinearellipticproblems.Weconsiderherethefollowingclassesofmappingsofgeneralizedmonotonetype.(QM)=theclassofquasi-mollotoneoperators,(S )=theclassofoperatorsoftype(S ),(PM)=theclassofpseudthmonotoneoperators,(LS)=theclassofLeray-Schauderoperators(compac… 相似文献