收费全文 | 11069篇 |
免费 | 600篇 |
国内免费 | 48篇 |
化学 | 8103篇 |
晶体学 | 37篇 |
力学 | 181篇 |
数学 | 1774篇 |
物理学 | 1622篇 |
2023年 | 82篇 |
2022年 | 113篇 |
2021年 | 166篇 |
2020年 | 251篇 |
2019年 | 217篇 |
2018年 | 158篇 |
2017年 | 126篇 |
2016年 | 442篇 |
2015年 | 404篇 |
2014年 | 438篇 |
2013年 | 537篇 |
2012年 | 725篇 |
2011年 | 757篇 |
2010年 | 555篇 |
2009年 | 445篇 |
2008年 | 718篇 |
2007年 | 625篇 |
2006年 | 596篇 |
2005年 | 593篇 |
2004年 | 499篇 |
2003年 | 366篇 |
2002年 | 344篇 |
2001年 | 180篇 |
2000年 | 150篇 |
1999年 | 167篇 |
1998年 | 126篇 |
1997年 | 172篇 |
1996年 | 127篇 |
1995年 | 130篇 |
1994年 | 122篇 |
1993年 | 114篇 |
1992年 | 120篇 |
1991年 | 74篇 |
1990年 | 59篇 |
1989年 | 82篇 |
1988年 | 67篇 |
1987年 | 41篇 |
1986年 | 42篇 |
1985年 | 67篇 |
1984年 | 58篇 |
1983年 | 33篇 |
1982年 | 65篇 |
1981年 | 50篇 |
1980年 | 46篇 |
1979年 | 39篇 |
1978年 | 46篇 |
1977年 | 31篇 |
1975年 | 38篇 |
1974年 | 34篇 |
1973年 | 24篇 |
In this context, we finally discuss the validity of the common application of transition state theory (TST) to elementary and overall reactions governing the dissolution process. In this discussion of crystal dissolution, we contrast TST applications with a stochastic, many-body treatment that has led to the development of a stepwave model. This discussion also focuses on the controversy caused by the rivalry between surface adsorption models and a probabilistic model that seeks to incorporate the full three-dimensional crystal structure. 相似文献
In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.
In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion. 相似文献