全文获取类型
收费全文 | 655篇 |
免费 | 32篇 |
国内免费 | 35篇 |
专业分类
化学 | 36篇 |
力学 | 3篇 |
综合类 | 10篇 |
数学 | 519篇 |
物理学 | 154篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 7篇 |
2021年 | 11篇 |
2020年 | 20篇 |
2019年 | 23篇 |
2018年 | 19篇 |
2017年 | 10篇 |
2016年 | 18篇 |
2015年 | 15篇 |
2014年 | 24篇 |
2013年 | 49篇 |
2012年 | 21篇 |
2011年 | 21篇 |
2010年 | 27篇 |
2009年 | 59篇 |
2008年 | 58篇 |
2007年 | 69篇 |
2006年 | 50篇 |
2005年 | 25篇 |
2004年 | 21篇 |
2003年 | 26篇 |
2002年 | 30篇 |
2001年 | 17篇 |
2000年 | 17篇 |
1999年 | 8篇 |
1998年 | 8篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 2篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 9篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1975年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有722条查询结果,搜索用时 78 毫秒
81.
Andrew V. Goldberg Michael D. Grigoriadis Robert E. Tarjan 《Mathematical Programming》1991,50(1-3):277-290
Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n
2
m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467. 相似文献
82.
This paper is an investigation of the structural properties of random plane-oriented recursive trees and their branches. We begin by an enumeration of these trees and some general properties related to the outdegrees of nodes. Using generalized Pólya urn models we study the exact and limiting distributions of the size and the number of leaves in the branches of the tree. The exact distribution for the leaves in the branches is given by formulas involving second-order Eulerian numbers. A martingale central limit theorem for a linear combination of the number of leaves and the number of internal nodes is derived. The distribution of that linear combination is a mixture of normals with a beta distribution as its mixing density. The martingale central limit theorem allows easy determination of the limit laws governing the leaves in the branches. Furthermore, the asymptotic joint distribution of the number of nodes of outdegree 0, 1 and 2 is shown to be trivariate normal. © 1993 John Wiley & Sons, Inc. 相似文献
83.
The concept of a minimum spanning tree (MST) is used to study patterns of comovements for a set of twenty government bond market indices for developed North American, European, and Asian countries. We show how the MST and its related hierarchical tree evolve over time and describe the dynamic development of market linkages. Over the sample period, 1993-2008, linkages between markets have decreased somewhat. However, a subset of European Union (EU) bond markets does show increasing levels of comovements. The evolution of distinct groups within the Eurozone is also examined. The implications of our findings for portfolio diversification benefits are outlined. 相似文献
84.
Mordecai J. Golin 《Discrete Mathematics》2010,310(4):792-803
Let T(G) be the number of spanning trees in graph G. In this note, we explore the asymptotics of T(G) when G is a circulant graph with given jumps.The circulant graph is the 2k-regular graph with n vertices labeled 0,1,2,…,n−1, where node i has the 2k neighbors i±s1,i±s2,…,i±sk where all the operations are . We give a closed formula for the asymptotic limit as a function of s1,s2,…,sk. We then extend this by permitting some of the jumps to be linear functions of n, i.e., letting si, di and ei be arbitrary integers, and examining
85.
Let M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian matrix). Two graphs are said to be cospectral with respect to M if they have the same M spectrum. A graph is said to be determined by M spectrum if there is no other non-isomorphic graph with the same spectrum with respect to M. It is shown that T-shape trees are determined by their Laplacian spectra. Moreover among them those are determined by their adjacency spectra are characterized. In this paper, we identify graphs which are cospectral to a given T-shape tree with respect to the signless Laplacian matrix. Subsequently, T-shape trees which are determined by their signless Laplacian spectra are identified. 相似文献
86.
M. Stich S. C. Manrubia 《The European Physical Journal B - Condensed Matter and Complex Systems》2009,70(4):583-592
The extent to which evolutionary processes affect the shape
of phylogenetic trees is an important open question. Analyses of
small trees seem to detect non-trivial asymmetries which are usually
ascribed to the presence of correlations in speciation rates. Many
models used to construct phylogenetic trees have an algorithmic
nature and are rarely biologically grounded. In this article, we
analyze the topological properties of phylogenetic trees generated
by different evolutionary models (populations of RNA sequences and a
simple model with inheritance and mutation) and compare them with
the trees produced by known uncorrelated models as the backward
coalescent, paying special attention to large trees. Our results
demonstrate that evolutionary parameters as mutation rate or
selection pressure have a weak influence on the scaling behavior of
the trees, while the size of phylogenies strongly affects measured
scaling exponents. Within statistical errors, the topological
properties of phylogenies generated by evolutionary models are
compatible with those measured in balanced, uncorrelated trees. 相似文献
87.
Zhongzhi Zhang Shuigeng Zhou Lichao Chen Jihong Guan 《The European Physical Journal B - Condensed Matter and Complex Systems》2008,64(2):277-283
Real networks can be classified into two categories: fractal networks and non-fractal networks. Here we introduce a unifying
model for the two types of networks. Our model network is governed by a parameter q. We obtain the topological properties of the network including the degree distribution, average path length, diameter, fractal
dimensions, and betweenness centrality distribution, which are controlled by parameter q. Interestingly, we show that by adjusting q, the networks undergo a transition from fractal to non-fractal scalings, and exhibit a crossover from ‘large’ to small worlds
at the same time. Our research may shed some light on understanding the evolution and relationships of fractal and non-fractal
networks. 相似文献
88.
M. Gligor M. Ausloos 《The European Physical Journal B - Condensed Matter and Complex Systems》2008,63(4):533-539
GDP/capita correlations are investigated in various time windows (TW), for the time interval 1990–2005. The target group of
countries is the set of 25 EU members, 15 till 2004 plus the 10 countries which joined EU later on. The TW-means of the statistical
correlation coefficients are taken as the weights (links) of a fully connected network having the countries as nodes. Thereafter
we define and introduce the overlapping index of weighted network nodes. A cluster structure of EU countries is derived from the statistically relevant eigenvalues and
eigenvectors of the adjacency matrix. This may be considered to yield some information about the structure, stability and
evolution of the EU country clusters in a macroeconomic sense. 相似文献
89.
Zhongzhi Zhang Shuigeng Zhou Yi Qi Jihong Guan 《The European Physical Journal B - Condensed Matter and Complex Systems》2008,63(4):507-513
The uniform recursive tree (URT) is one of the most important models and has been successfully applied to many fields. Here
we study exactly the topological characteristics and spectral properties of the Laplacian matrix of a deterministic uniform
recursive tree, which is a deterministic version of URT. Firstly, from the perspective of complex networks, we determine the
main structural characteristics of the deterministic tree. The obtained vigorous results show that the network has an exponential
degree distribution, small average path length, power-law distribution of node betweenness, and positive degree-degree correlations.
Then we determine the complete Laplacian spectra (eigenvalues) and their corresponding eigenvectors of the considered graph.
Interestingly, all the Laplacian eigenvalues are distinct. 相似文献
90.
Zhongzhi Zhang Shuigeng Zhou Zhan Su Tao Zou Jihong Guan 《The European Physical Journal B - Condensed Matter and Complex Systems》2008,65(1):141-147
In this paper, we define a stochastic Sierpinski gasket, on the basis of which we construct a network called random Sierpinski
network (RSN). We investigate analytically or numerically the statistical characteristics of RSN. The obtained results reveal
that the properties of RSN is particularly rich, it is simultaneously scale-free, small-world, uncorrelated, modular, and
maximal planar. All obtained analytical predictions are successfully contrasted with extensive numerical simulations. Our
network representation method could be applied to study the complexity of some real systems in biological and information
fields. 相似文献