全文获取类型
收费全文 | 1727篇 |
免费 | 114篇 |
国内免费 | 97篇 |
专业分类
化学 | 428篇 |
力学 | 29篇 |
综合类 | 60篇 |
数学 | 1167篇 |
物理学 | 254篇 |
出版年
2024年 | 3篇 |
2023年 | 23篇 |
2022年 | 95篇 |
2021年 | 76篇 |
2020年 | 57篇 |
2019年 | 57篇 |
2018年 | 48篇 |
2017年 | 61篇 |
2016年 | 63篇 |
2015年 | 48篇 |
2014年 | 70篇 |
2013年 | 137篇 |
2012年 | 63篇 |
2011年 | 76篇 |
2010年 | 90篇 |
2009年 | 96篇 |
2008年 | 118篇 |
2007年 | 109篇 |
2006年 | 94篇 |
2005年 | 55篇 |
2004年 | 67篇 |
2003年 | 59篇 |
2002年 | 49篇 |
2001年 | 49篇 |
2000年 | 43篇 |
1999年 | 35篇 |
1998年 | 38篇 |
1997年 | 20篇 |
1996年 | 27篇 |
1995年 | 16篇 |
1994年 | 14篇 |
1993年 | 12篇 |
1992年 | 7篇 |
1991年 | 9篇 |
1990年 | 6篇 |
1989年 | 5篇 |
1987年 | 5篇 |
1986年 | 8篇 |
1985年 | 4篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 10篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1938条查询结果,搜索用时 15 毫秒
1.
Searching in trees 总被引:1,自引:0,他引:1
Frank Recker 《Discrete Applied Mathematics》2004,140(1-3):169-183
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given. 相似文献
2.
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically. 相似文献
3.
应用七级目测法对浙江中部地区27个夏熟作物田样点的杂草进行了优势等级调查,将所得数据转换成重要值,以杂草在27个样点中的重要值为运算指标,应用主成分分析法和图论聚类中的最小生成树法,对24种杂草的生态学相似性进行了比较,指出了长期使用单一的除草剂导致农田杂草种群迅速更迭的原因:杂草对除草剂的敏感性差异及不同杂草间的生态学特性的差异。 相似文献
4.
Bounds are given on the size of the parameter-space decomposition induced by multiple sequence alignment problems where phylogenetic information may be given or inferred. It is shown that many of the usual formulations of these problems fall within the same integer parametric framework, implying that the number of distinct optima obtained as the parameters are varied across their ranges is polynomially bounded in the length and number of sequences. 相似文献
5.
Alexander Zimmermann 《Algebras and Representation Theory》2004,7(1):19-34
In an earlier paper, Raphaël Rouquier and the author introduced the group of self-equivalences of a derived category. In the case of a Brauer tree algebra, we determined a nontrivial homomorphism of the Artin braid group to this group of self-equivalences. The class of Brauer tree algebras include blocks of finite group rings over a large enough field with cyclic defect groups. In the present paper we give an integral version of this homomorphism. Moreover, we identify some interesting arithmetic subgroups with natural groups of self-equivalences of the derived category. 相似文献
6.
Marco Pretti 《Journal of statistical physics》2003,111(3-4):993-1015
In this article we deal with the variational approach to cactus trees (Husimi trees) and the more common recursive approach, that are in principle equivalent for finite systems. We discuss in detail the conditions under which the two methods are equivalent also in the analysis of infinite (self-similar) cactus trees, usually investigated to the purpose of approximating ordinary lattice systems. Such issue is hardly ever considered in the literature. We show (on significant test models) that the phase diagram and the thermodynamic quantities computed by the variational method, when they deviates from the exact bulk properties of the cactus system, generally provide a better approximation to the behavior of a corresponding ordinary system. Generalizing a property proved by Kikuchi, we also show that the numerical algorithm usually employed to perform the free energy minimization in the variational approach is always convergent. 相似文献
7.
首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明.最后对找到最优解后信息素值的变化进行了分析.即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值. 相似文献
8.
Andreas Rößler 《BIT Numerical Mathematics》2006,46(1):97-110
A general class of stochastic Runge–Kutta methods for Itô stochastic differential equation systems w.r.t. a one-dimensional Wiener process is introduced. The colored rooted tree analysis is applied to derive conditions for the coefficients of the stochastic Runge–Kutta method assuring convergence in the weak sense with a prescribed order. Some coefficients for new stochastic Runge–Kutta schemes of order two are calculated explicitly and a simulation study reveals their good performance. 相似文献
9.
We construct random locally compact real trees called Lévy trees that are the genealogical trees associated with continuous-state
branching processes. More precisely, we define a growing family of discrete Galton–Watson trees with i.i.d. exponential branch
lengths that is consistent under Bernoulli percolation on leaves; we define the Lévy tree as the limit of this growing family
with respect to the Gromov–Hausdorff topology on metric spaces. This elementary approach notably includes supercritical trees
and does not make use of the height process introduced by Le Gall and Le Jan to code the genealogy of (sub)critical continuous-state
branching processes. We construct the mass measure of Lévy trees and we give a decomposition along the ancestral subtree of
a Poisson sampling directed by the mass measure.
T. Duquesne is supported by NSF Grants DMS-0203066 and DMS-0405779. M. Winkel is supported by Aon and the Institute of Actuaries,
EPSRC Grant GR/T26368/01, le département de mathématique de l’Université d’Orsay and NSF Grant DMS-0405779. 相似文献
10.
The Randi? index R(G) of a (chemical) graph G is also called connectivity index. Hansen and Mélot [Variable neighborhood search for extremal graphs 6: analyzing bounds for the connectivity index, J. Chem. Inf. Comput. Sci. 43 (2003) 1-14] in their paper, characterized the chemical trees of given order and number of pendent vertices which have the minimum and maximum Randi? index, respectively. In this note, we point out the mistakes in the proofs of their results Theorems 8 and 10, while we still believe that the two theorems are true, and then we give their corrected proofs. 相似文献