全文获取类型
收费全文 | 1390篇 |
免费 | 102篇 |
国内免费 | 88篇 |
专业分类
化学 | 144篇 |
力学 | 24篇 |
综合类 | 48篇 |
数学 | 1151篇 |
物理学 | 213篇 |
出版年
2024年 | 2篇 |
2023年 | 15篇 |
2022年 | 42篇 |
2021年 | 31篇 |
2020年 | 39篇 |
2019年 | 47篇 |
2018年 | 38篇 |
2017年 | 48篇 |
2016年 | 46篇 |
2015年 | 36篇 |
2014年 | 59篇 |
2013年 | 115篇 |
2012年 | 49篇 |
2011年 | 67篇 |
2010年 | 82篇 |
2009年 | 84篇 |
2008年 | 112篇 |
2007年 | 99篇 |
2006年 | 88篇 |
2005年 | 45篇 |
2004年 | 57篇 |
2003年 | 56篇 |
2002年 | 44篇 |
2001年 | 44篇 |
2000年 | 36篇 |
1999年 | 32篇 |
1998年 | 34篇 |
1997年 | 15篇 |
1996年 | 22篇 |
1995年 | 14篇 |
1994年 | 13篇 |
1993年 | 7篇 |
1992年 | 5篇 |
1991年 | 9篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1987年 | 3篇 |
1986年 | 8篇 |
1985年 | 4篇 |
1984年 | 5篇 |
1983年 | 1篇 |
1982年 | 9篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1580条查询结果,搜索用时 708 毫秒
71.
Adrien Joseph 《Random Structures and Algorithms》2011,39(2):247-274
We provide information about the asymptotic regimes for a homogeneous fragmentation of a finite set. We establish a phase transition for the asymptotic behavior of the shattering times, defined as the first instants when all the blocks of the partition process have cardinality less than a fixed integer. Our results may be applied to the study of certain random split trees. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 39, 247‐274, 2011 相似文献
72.
Based on the property analysis of interferential multispectral images, a novel compression algorithm of partial set partitioning in hierarchical trees (SPIHT) with classified weighted rate-distortion optimization is presented.After wavelet decomposition, partial SPIHT is applied to each zero tree independently by adaptively selecting one of three coding modes according to the probability of the significant coefficients in each bitplane.Meanwhile the interferential multispectral image is partitioned into two kinds of regions in terms of luminous intensity, and the rate-distortion slopes of zero trees are then lifted with classified weights according to their distortion contribution to the constructed spectrum.Finally a global ratedistortion optimization truncation is performed.Compared with the conventional methods, the proposed algorithm not only improves the performance in spatial domain but also reduces the distortion in spectral domain. 相似文献
73.
Joonmo Kim Mihaela Cardei Ionut Cardei Xiaohua Jia 《Journal of Global Optimization》2002,24(4):437-448
In this paper, we present the design of a Polynomial Time Approximation Scheme (PTAS) for the Grade of Service Steiner Minimum Tree (GOSST) problem, which is known to be NP-Complete. Previous research has focused on geometric analyses and different approximation algorithms have been designed. We propose a PTAS that provides a polynomial time, near-optimal solution with performance ratio 1+. The GOSST problem has some important applications. In network design, a fundamental issue for the physical construction of a network structure is the interconnection of many communication sites with the best choice of the connecting lines and the best allocation of the transmission capacities over these lines. Good solutions should provide paths with enough communication capacities between any two sites, with the least network construction costs. Also, the GOSST problem has applications in transportation, for road constructions and some potential uses in CAD in terms of interconnecting the elements on a plane to provide enough flux between any two elements. 相似文献
74.
Julie Kerr 《Journal of Algebraic Combinatorics》1999,9(1):47-60
For a fixed positive integer k, consider the collection of all affine hyperplanes in n-space given by xi – xj = m, where i, j [n], i j, and m {0, 1,..., k}. Let Ln,k be the set of all nonempty affine subspaces (including the empty space) which can be obtained by intersecting some subset of these affine hyperplanes. Now give Ln,k a lattice structure by ordering its elements by reverse inclusion. The symmetric group Gn acts naturally on Ln,k by permuting the coordinates of the space, and this action extends to an action on the top homology of Ln,k. It is easy to show by computing the character of this action that the top homology is isomorphic as an Gn-module to a direct sum of copies of the regular representation, CGn. In this paper, we construct an explicit basis for the top homology of Ln,k, where the basis elements are indexed by all labelled, rooted, (k + 1)-ary trees on n-vertices in which the root has no 0-child. This construction gives an explicit Gn-equivariant isomorphism between the top homology of Ln,k and a direct sum of copies of CGn. 相似文献
75.
We analyze the free boson gas on a Cayley tree using two alternative methods. The spectrum of the lattice Laplacian on a finite tree is obtained using a direct iterative method for solving the associated characteristic equation and also using a random walk representation for the corresponding fermion lattice gas. The existence of the thermodynamic limit for the pressure of the boson lattice gas is proven and it is shown that the model exhibits boson condensation into the ground state. The random walk representation is also used to derive an expression for the Bethe approximation to the infinite-volume spectrum. This spectrum turns out to be continuous instead of a dense point spectrum, but there is still boson condensation in this approximation. 相似文献
76.
Olle Häggström 《Journal of statistical physics》1996,84(5-6):1351-1361
We study the random-cluster model on a homogeneous tree, and show that the following three conditions are equivalent for a random-cluster measure: quasilocality, almost sure quasilocality, and the almost sure nonexistence of infinite clusters. As a consequence of this, we find that the plus measure for the Ising model on a tree at sufficiently low temperatures can be mapped, via a local stochastic transformation, into a measure which fails to be almost surely quasilocal. 相似文献
77.
We study fundamental properties of monotone network enterprises which contain public vertices and have positive and negative
costs on edges and vertices. Among the properties studied are the nonemptiness of the core, characterization of nonredundant
core constraints, ease of computation of the core and the nucleolus, and cases of decomposition of the core and the nucleolus.
Received December 1994/Final version March 1998 相似文献
78.
Christos A. Athanasiadis 《Journal of Algebraic Combinatorics》1996,5(1):5-11
The Laplacian of a directed graph G is the matrix L(G) = O(G) –, A(G) where A(G) is the adjaceney matrix of G and O(G) the diagonal matrix of vertex outdegrees. The eigenvalues of G are the eigenvalues of A(G). Given a directed graph G we construct a derived directed graph D(G) whose vertices are the oriented spanning trees of G. Using a counting argument, we describe the eigenvalues of D(G) and their multiplicities in terms of the eigenvalues of the induced subgraphs and the Laplacian matrix of G. Finally we compute the eigenvalues of D(G) for some specific directed graphs G. A recent conjecture of Propp for D(H
n
) follows, where H
n
stands for the complete directed graph on n vertices without loops. 相似文献
79.
Ananias M. Mariz Constantino Tsallis E. L. Albuquerque 《Journal of statistical physics》1985,40(3-4):577-592
We study the phase diagram for the Ising Model on a Cayley tree with competing nearest-neighbor interactionsJ
1 and next-nearest-neighbor interactionsJ
2 andJ
3 in the presence of an external magnetic field. To perform this study, an iterative scheme similar to that appearing in real space renormalization group frameworks is established; it recovers, as particular cases, previous works by Vannimenus and by Inawashiroet al. At vanishing temperature, the phase diagram is fully determined, for all values and signs ofJ
2/J
1 andJ
3/J
2; in particular, we verify that values ofJ
3/J
2 high enough favor the paramagnetic phase. At finite temperatures, several interesting features (evolution of reentrances, separation of the modulated region into two disconnected pieces, etc.) are exhibited for typical values ofJ
2/J
1 andJ
3/J
2.Partially supported by the Brazilian Agencies CNPq and FINEP. 相似文献
80.
G-protein coupled receptors (GPCRs) play a key role in different biological processes, such as regulation of growth, death and metabolism of cells. They are major therapeutic targets of numerous prescribed drugs. However, the ligand specificity of many receptors is unknown and there is little structural information available. Bioinformatics may offer one approach to bridge the gap between sequence data and functional knowledge of a receptor. In this paper, we use a bagging classification tree algorithm to predict the type of the receptor based on its amino acid composition. The prediction is performed for GPCR at the sub-family and sub-sub-family level. In a cross-validation test, we achieved an overall predictive accuracy of 91.1% for GPCR sub-family classification, and 82.4% for sub-sub-family classification. These results demonstrate the applicability of this relative simple method and its potential for improving prediction accuracy. 相似文献