全文获取类型
收费全文 | 3757篇 |
免费 | 67篇 |
国内免费 | 4篇 |
专业分类
化学 | 2676篇 |
晶体学 | 11篇 |
力学 | 49篇 |
数学 | 652篇 |
物理学 | 440篇 |
出版年
2020年 | 25篇 |
2019年 | 25篇 |
2018年 | 38篇 |
2017年 | 36篇 |
2016年 | 51篇 |
2015年 | 67篇 |
2014年 | 57篇 |
2013年 | 125篇 |
2012年 | 110篇 |
2011年 | 136篇 |
2010年 | 116篇 |
2009年 | 111篇 |
2008年 | 143篇 |
2007年 | 151篇 |
2006年 | 132篇 |
2005年 | 146篇 |
2004年 | 133篇 |
2003年 | 105篇 |
2002年 | 113篇 |
2001年 | 67篇 |
2000年 | 91篇 |
1999年 | 79篇 |
1998年 | 52篇 |
1997年 | 58篇 |
1996年 | 49篇 |
1995年 | 50篇 |
1994年 | 41篇 |
1993年 | 64篇 |
1992年 | 55篇 |
1991年 | 45篇 |
1990年 | 37篇 |
1989年 | 35篇 |
1988年 | 44篇 |
1987年 | 36篇 |
1986年 | 56篇 |
1985年 | 64篇 |
1984年 | 44篇 |
1983年 | 39篇 |
1982年 | 42篇 |
1981年 | 54篇 |
1980年 | 42篇 |
1979年 | 56篇 |
1978年 | 43篇 |
1977年 | 44篇 |
1976年 | 39篇 |
1975年 | 33篇 |
1974年 | 35篇 |
1973年 | 24篇 |
1972年 | 26篇 |
1970年 | 25篇 |
排序方式: 共有3828条查询结果,搜索用时 875 毫秒
1.
2.
Julien Ferrari Christian Terreaux Tibor Kurtn Attila Szikszai‐Kiss Sndor Antus JeromeD. Msonthi Kurt Hostettmann 《Helvetica chimica acta》2003,86(8):2768-2778
Investigation of the methanol extract of the roots of Gnidia involucrata (Thymelaeaceae) led to the isolation and characterization of two new 3,8″‐biflavonoid diastereoisomers, named GB‐4 ( 6a ) and GB‐4a ( 6b ). Their absolute configurations were determined in mixture by on‐line LC/CD measurements, which also allowed the revision of absolute configurations of the biflavanoids GB‐1 and GB‐2, and the configurational assignment of GB‐3. 相似文献
3.
Kurt Majewski 《Queueing Systems》2005,50(2-3):199-230
We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20 相似文献
4.
Mathematical Methods of Operations Research - 相似文献
5.
Kurt M. Anstreicher 《Mathematical Programming》1997,76(1):245-263
We consider the construction of small step path following algorithms using volumetric, and mixed volumetric-logarithmic, barriers.
We establish quadratic convergence of a volumetric centering measure using pure Newton steps, enabling us to use relatively
standard proof techniques for several subsequently needed results. Using a mixed volumetric-logarithmic barrier we obtain
an O(n
1/4
m
1/4
L) iteration algorithm for linear programs withn variables andm inequality constraints, providing an alternative derivation for results first obtained by Vaidya and Atkinson. In addition,
we show that the same iteration complexity can be attained while holding the work per iteration to O(n
2
m), as opposed to O(nm
2), operations, by avoiding use of the true Hessian of the volumetric barrier. Our analysis also provides a simplified proof
of self-concordancy of the volumetric and mixed volumetric-logarithmic barriers, originally due to Nesterov and Nemirovskii.
This paper was first presented at the 1994 Faculty Research Seminar “Optimization in Theory and Practice”, at the University
of Iowa Center for Advanced Studies. 相似文献
6.
We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help. 相似文献
7.
We present a new verified optimization method to find regions for Hénon systems where the conditions of chaotic behaviour
hold. The present paper provides a methodology to verify chaos for certain mappings and regions. We discuss first how to check
the set theoretical conditions of a respective theorem in a reliable way by computer programs. Then we introduce optimization
problems that provide a model to locate chaotic regions. We prove the correctness of the underlying checking algorithms and
the optimization model. We have verified an earlier published chaotic region, and we also give new chaotic places located
by the new technique. 相似文献
8.
A two-dimensional framework (G,p) is
a graph G = (V,E) together with a map p: V → ℝ2. We view (G,p) as a straight line realization of G in ℝ2. Two realizations of G are equivalent if the corresponding edges in the two frameworks have the same length.
A pair of vertices {u,v} is globally linked in G if %and for all equivalent frameworks (G,q), the distance between the points
corresponding to u and v is the same
in all pairs of equivalent generic realizations of G. The graph G is globally rigid
if all of its pairs of vertices are globally linked. We extend the characterization of globally rigid graphs given by the
first two authors [13] by characterizing globally linked pairs in M-connected graphs, an important family of rigid graphs.
As a byproduct we simplify the proof of a result of Connelly [6] which is a key step in the characterization of globally rigid
graphs. We also determine the number of distinct realizations of an M-connected graph, each of which is equivalent to a given
generic realization. Bounds on this number for minimally rigid graphs were obtained by Borcea and Streinu in [3]. 相似文献
9.
Presented by R. Freese. 相似文献
10.
Dan Hefetz Michael Krivelevich Tibor Szabó 《Journal of Combinatorial Theory, Series A》2007,114(5):840-853
Let p and q be positive integers and let H be any hypergraph. In a (p,q,H) Avoider-Enforcer game two players, called Avoider and Enforcer, take turns selecting previously unclaimed vertices of H. Avoider selects p vertices per move and Enforcer selects q vertices per move. Avoider loses if he claims all the vertices of some hyperedge of H; otherwise Enforcer loses. We prove a sufficient condition for Avoider to win the (p,q,H) game. We then use this condition to show that Enforcer can win the (1,q) perfect matching game on K2n for every q?cn/logn for an appropriate constant c, and the (1,q) Hamilton cycle game on Kn for every q?cnloglogloglogn/lognlogloglogn for an appropriate constant c. We also determine exactly those values of q for which Enforcer can win the (1,q) connectivity game on Kn. This result is quite surprising as it substantially differs from its Maker-Breaker analog. Our method extends easily to improve a result of Lu [X. Lu, A note on biased and non-biased games, Discrete Appl. Math. 60 (1995) 285-291], regarding forcing an opponent to pack many pairwise edge disjoint spanning trees in his graph. 相似文献