全文获取类型
收费全文 | 2372篇 |
免费 | 77篇 |
国内免费 | 23篇 |
专业分类
化学 | 1465篇 |
晶体学 | 7篇 |
力学 | 42篇 |
数学 | 399篇 |
物理学 | 559篇 |
出版年
2023年 | 9篇 |
2022年 | 27篇 |
2021年 | 28篇 |
2020年 | 38篇 |
2019年 | 29篇 |
2018年 | 30篇 |
2017年 | 36篇 |
2016年 | 61篇 |
2015年 | 59篇 |
2014年 | 61篇 |
2013年 | 121篇 |
2012年 | 186篇 |
2011年 | 176篇 |
2010年 | 123篇 |
2009年 | 110篇 |
2008年 | 158篇 |
2007年 | 164篇 |
2006年 | 167篇 |
2005年 | 203篇 |
2004年 | 138篇 |
2003年 | 124篇 |
2002年 | 115篇 |
2001年 | 19篇 |
2000年 | 23篇 |
1999年 | 15篇 |
1998年 | 15篇 |
1997年 | 15篇 |
1996年 | 33篇 |
1995年 | 17篇 |
1994年 | 17篇 |
1993年 | 19篇 |
1992年 | 11篇 |
1991年 | 5篇 |
1990年 | 8篇 |
1989年 | 12篇 |
1988年 | 5篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 12篇 |
1984年 | 10篇 |
1983年 | 10篇 |
1982年 | 9篇 |
1981年 | 10篇 |
1980年 | 5篇 |
1979年 | 7篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1970年 | 2篇 |
排序方式: 共有2472条查询结果,搜索用时 15 毫秒
11.
12.
13.
Anna Hayer Tanguy Van Regemorter Bianca Höfer Chris S. K. Mak David Beljonne Anna Köhler 《Journal of Polymer Science.Polymer Physics》2012,50(5):361-369
Although carbazole‐containing copolymers are frequently used as hole‐transporting host materials for polymer organic light‐emitting diodes (OLEDs), they often suffer from the formation of undesired exciplexes when the OLED is operated. The reason why exciplexes sometimes form for electrical excitation, yet not for optical excitation is not well understood. Here, we use luminescence measurements and quantum chemical calculations to investigate the mechanism of such exciplex formation for electrical excitation (electroplex formation) in a carbazole–pyridine copolymer. Our results suggest that the exciplex is formed via a positively charged interchain precursor complex. This complex is stabilized by interactions that involve the nitrogen lone pairs on both chain segments. © 2011 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys, 2012 相似文献
14.
There are consistently estimable parameters of interest whose semiparametric Fisher information vanishes at some points of the model in question. Here we investigate how bad this is for estimation. 相似文献
15.
Chris Hope 《The Journal of the Operational Research Society》2003,54(11):1167-1176
What strategy should a football (soccer, in American parlance) club adopt when deciding whether to sack its manager? This paper introduces a simple model assuming that a club's objective is to maximize the number of league points that it scores per season. The club's strategy consists of three choices: the length of the honeymoon period during which it will not consider sacking a new manager, the level of the performance trapdoor below which the manager get the sack, and the weight that it will give to more recent games compared to earlier ones. Some data from the last six seasons of the English Premiership are used to calibrate the model. At this early stage of the research, the best strategy appears to have only a short honeymoon period of eight games (much less than the actual shortest period of 12 games), to set the trapdoor at 0.74 points per game, and to put 47% of the weight on the last five games. A club adopting this strategy would obtain on average 56.8 points per season, compared to a Premiership average of 51.8 points. 相似文献
16.
Chris Pollett 《Archive for Mathematical Logic》2003,42(5):469-488
The paper establishes lower bounds on the provability of 𝒟=NP and the MRDP theorem in weak fragments of arithmetic. The
theory I
5
E
1
is shown to be unable to prove 𝒟=NP. This non-provability result is used to show that I
5
E
1
cannot prove the MRDP theorem. On the other hand it is shown that I
1
E
1
proves 𝒟 contains all predicates of the form (∀i≤|b|)P(i,x)^Q(i,x) where ^ is =, <, or ≤, and I
0
E
1
proves 𝒟 contains all predicates of the form (∀i≤b)P(i,x)=Q(i,x). Here P and Q are polynomials. A conjecture is made that 𝒟 contains NLOGTIME. However, it is shown that this conjecture would not be sufficient
to imply 𝒟=N P. Weak reductions to equality are then considered as a way of showing 𝒟=NP. It is shown that the bit-wise less than predicate,
≤2, and equality are both co-NLOGTIME complete under FDLOGTIME reductions. This is used to show that if the FDLOGTIME functions
are definable in 𝒟 then 𝒟=N P.
Received: 13 July 2001 / Revised version: 9 April 2002 /
Published online: 19 December 2002
Key words or phrases: Bounded Arithmetic – Bounded Diophantine Complexity 相似文献
17.
Jean-Marie Lion Chris Miller Patrick Speissegger 《Proceedings of the American Mathematical Society》2003,131(1):175-183
We investigate the asymptotic behavior at of non-oscillatory solutions to differential equations a$">, where is definable in a polynomially bounded o-minimal structure. In particular, we show that the Pfaffian closure of a polynomially bounded o-minimal structure on the real field is levelled.
18.
For a non-connected reductive -adic group, we prove that the Langlands subrepresentation appears with multiplicity one in the representation parabolically induced from the corresponding Langlands data.
19.
20.