全文获取类型
收费全文 | 2100篇 |
免费 | 132篇 |
国内免费 | 108篇 |
专业分类
化学 | 210篇 |
力学 | 56篇 |
综合类 | 51篇 |
数学 | 1703篇 |
物理学 | 320篇 |
出版年
2024年 | 5篇 |
2023年 | 37篇 |
2022年 | 69篇 |
2021年 | 47篇 |
2020年 | 63篇 |
2019年 | 76篇 |
2018年 | 58篇 |
2017年 | 66篇 |
2016年 | 63篇 |
2015年 | 55篇 |
2014年 | 102篇 |
2013年 | 163篇 |
2012年 | 84篇 |
2011年 | 105篇 |
2010年 | 120篇 |
2009年 | 137篇 |
2008年 | 159篇 |
2007年 | 144篇 |
2006年 | 121篇 |
2005年 | 65篇 |
2004年 | 72篇 |
2003年 | 62篇 |
2002年 | 55篇 |
2001年 | 60篇 |
2000年 | 43篇 |
1999年 | 47篇 |
1998年 | 49篇 |
1997年 | 26篇 |
1996年 | 28篇 |
1995年 | 24篇 |
1994年 | 28篇 |
1993年 | 16篇 |
1992年 | 13篇 |
1991年 | 11篇 |
1990年 | 7篇 |
1989年 | 5篇 |
1987年 | 4篇 |
1986年 | 9篇 |
1985年 | 5篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 10篇 |
1981年 | 7篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有2340条查询结果,搜索用时 15 毫秒
71.
We consider a multidimensional diffusion X with drift coefficient b(α,Xt) and diffusion coefficient ?σ(β,Xt). The diffusion sample path is discretely observed at times tk=kΔ for k=1…n on a fixed interval [0,T]. We study minimum contrast estimators derived from the Gaussian process approximating X for small ?. We obtain consistent and asymptotically normal estimators of α for fixed Δ and ?→0 and of (α,β) for Δ→0 and ?→0 without any condition linking ? and Δ. We compare the estimators obtained with various methods and for various magnitudes of Δ and ? based on simulation studies. Finally, we investigate the interest of using such methods in an epidemiological framework. 相似文献
72.
In this paper, we analyze cost sharing problems arising from a general service by explicitly taking into account the generated revenues. To this cost-revenue sharing problem, we associate a cooperative game with transferable utility, called cost-revenue game. By considering cooperation among the agents using the general service, the value of a coalition is defined as the maximum net revenues that the coalition may obtain by means of cooperation. As a result, a coalition may profit from not allowing all its members to get the service that generates the revenues. We focus on the study of the core of cost-revenue games. Under the assumption that cooperation among the members of the grand coalition grants the use of the service under consideration to all its members, it is shown that a cost-revenue game has a nonempty core for any vector of revenues if, and only if, the dual game of the cost game has a large core. Using this result, we investigate minimum cost spanning tree games with revenues. We show that if every connection cost can take only two values (low or high cost), then, the corresponding minimum cost spanning tree game with revenues has a nonempty core. Furthermore, we provide an example of a minimum cost spanning tree game with revenues with an empty core where every connection cost can take only one of three values (low, medium, or high cost). 相似文献
73.
一阶数≥3的简单连通图叫做1-Hamilton连通的,若对每一对顶点v_1、v_2及任一边v_2v_3(v_1≠v_3),存在连接v_1和v_2,并且经过v_3v_2的Hamilton路.本文中我们证明:连通图的树图或是1-Hamilton连通的,或为一超立方体,或同构于K_2×K_3和W_5之一. 相似文献
74.
Arie Tamir 《Mathematical Programming》1993,62(1-3):475-496
In the classicalp-center location model on a network there is a set of customers, and the primary objective is to selectp service centers that will minimize the maximum distance of a customer to a closest center. Suppose that thep centers receive their supplies from an existing central depot on the network, e.g. a warehouse. Thus, a secondary objective is to locate the centers that optimize the primary objective as close as possible to the central depot. We consider tree networks and twop-center models. We show that the set of optimal solutions to the primary objective has a semilattice structure with respect to some natural ordering. Using this property we prove that there is ap-center solution to the primary objective that simultaneously minimizes every secondary objective function which is monotone nondecreasing in the distances of thep centers from the existing central depot.Restricting the location models to a rooted path network (real line) we prove that the above results hold for the respective classicalp-median problems as well. 相似文献
75.
林全文 《数学的实践与认识》2002,32(3):450-454
本文应用计算生成树个数的有向图方法、分块矩阵的行列式计算法以及常系数线性递归方程的解法 ,计算得到轮图和多轮图的生成树个数的表达式 (显式或递推式 ) 相似文献
76.
A random graph Gn(x) is constructed on independent random points U1,…,Un distributed uniformly on [0,1]d, d1, in which two distinct such points are joined by an edge if the l∞-distance between them is at most some prescribed value 0<x<1. The connectivity distance cn, the smallest x for which Gn(x) is connected, is shown to satisfy For d2, the random graph Gn(x) behaves like a d-dimensional version of the random graphs of Erdös and Rényi, despite the fact that its edges are not independent: cn/dn→1, a.s., as n→∞, where dn is the largest nearest-neighbor link, the smallest x for which Gn(x) has no isolated vertices. 相似文献
77.
In this paper we examine the interactions between the topology of certain linearly ordered topological spaces (LOTS) and the properties of trees in whose branch spaces they embed. As one example of the interaction between ordered spaces and trees, we characterize hereditary ultraparacompactness in a LOTS (or GO-space) X in terms of the possibility of embedding the space X in the branch space of a certain kind of tree. 相似文献
78.
In this paper, we are interested in the following question: given an arbitrary Steiner triple system on vertices and any 3‐uniform hypertree on vertices, is it necessary that contains as a subgraph provided ? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive. 相似文献
79.
Shao-Hua Liu 《Discrete Mathematics》2019,342(12):111612
We introduce a method to construct bijections on increasing trees. Using this method, we construct an involution on increasing trees, from which we obtain the equidistribution of the statistics ‘number of odd vertices’ and ‘number of even vertices at odd levels’. As an application, we deduce that the expected value of the number of even vertices is twice the expected value of the number of odd vertices in a random recursive tree of given size. 相似文献
80.
In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these codes is given. 相似文献