全文获取类型
收费全文 | 16707篇 |
免费 | 1589篇 |
国内免费 | 1686篇 |
专业分类
化学 | 1444篇 |
晶体学 | 21篇 |
力学 | 904篇 |
综合类 | 331篇 |
数学 | 14028篇 |
物理学 | 3254篇 |
出版年
2024年 | 33篇 |
2023年 | 134篇 |
2022年 | 207篇 |
2021年 | 277篇 |
2020年 | 328篇 |
2019年 | 411篇 |
2018年 | 408篇 |
2017年 | 482篇 |
2016年 | 551篇 |
2015年 | 374篇 |
2014年 | 770篇 |
2013年 | 1254篇 |
2012年 | 795篇 |
2011年 | 894篇 |
2010年 | 873篇 |
2009年 | 1116篇 |
2008年 | 1105篇 |
2007年 | 1157篇 |
2006年 | 1032篇 |
2005年 | 951篇 |
2004年 | 800篇 |
2003年 | 773篇 |
2002年 | 760篇 |
2001年 | 599篇 |
2000年 | 592篇 |
1999年 | 574篇 |
1998年 | 467篇 |
1997年 | 419篇 |
1996年 | 318篇 |
1995年 | 224篇 |
1994年 | 188篇 |
1993年 | 140篇 |
1992年 | 134篇 |
1991年 | 108篇 |
1990年 | 78篇 |
1989年 | 71篇 |
1988年 | 62篇 |
1987年 | 54篇 |
1986年 | 46篇 |
1985年 | 64篇 |
1984年 | 77篇 |
1983年 | 31篇 |
1982年 | 56篇 |
1981年 | 31篇 |
1980年 | 38篇 |
1979年 | 34篇 |
1978年 | 18篇 |
1977年 | 21篇 |
1976年 | 14篇 |
1973年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
961.
R. Słowik 《Linear and Multilinear Algebra》2013,61(4):672-694
We consider three linear preserver problems on the algebra of infinite triangular matrices over fields. We characterize the maps preserving invertible and noninvertible matrices, the surjective maps preserving inverses and the surjective maps preserving rank permutability. 相似文献
962.
963.
A coloring of the vertices of a graph G is convex if, for each assigned color d, the vertices with color d induce a connected subgraph of G. We address the convex recoloring problem, defined as follows. Given a graph G and a coloring of its vertices, recolor a minimum number of vertices of G, so that the resulting coloring is convex. This problem is known to be NP-hard even when G is a path. We show an integer programming formulation for the weighted version of this problem on arbitrary graphs, and then specialize it for trees. We study the facial structure of the polytope defined as the convex hull of the integer points satisfying the restrictions of the proposed ILP formulation, present several classes of facet-defining inequalities and discuss separation algorithms. 相似文献
964.
In this paper we present a lower bound of the disjunctive rank of the facets describing the stable set polytope of joined a-perfect graphs. This class contains near-bipartite, t-perfect, h-perfect and complement of fuzzy interval graphs, among others. The stable set polytope of joined a-perfect graphs is described by means of full rank constraints of its node induced prime antiwebs. As a first step, we completely determine the disjunctive rank of all these constraints. Using this result we obtain a lower bound of the disjunctive index of joined a-perfect graphs and prove that this bound can be achieved. In addition, we completely determine the disjunctive index of every antiweb and observe that it does not always coincide with the disjunctive rank of its full rank constraint. 相似文献
965.
966.
967.
S. Agrawal 《Journal of Difference Equations and Applications》2013,19(11):1502-1522
In this article, we consider basic hypergeometric functions introduced by Heine. We study the mapping properties of certain ratios of basic hypergeometric functions having shifted parameters and show that they map the domains of analyticity onto domains convex in the direction of the imaginary axis. In order to investigate these mapping properties, some useful identities are obtained in terms of basic hypergeometric functions. In addition, we find conditions under which the basic hypergeometric functions are in a q-close-to-convex family. 相似文献
968.
969.
Peter F. Thall Richard Simon David A. Grier 《Journal of computational and graphical statistics》2013,22(1):41-61
Abstract Test-based variable selection algorithms in regression often are based on sequential comparison of test statistics to cutoff values. A predetermined a level typically is used to determine the cutoffs based on an assumed probability distribution for the test statistic. For example, backward elimination or forward stepwise involve comparisons of test statistics to prespecified t or F cutoffs in Gaussian linear regression, while a likelihood ratio. Wald, or score statistic, is typically used with standard normal or chi square cutoffs in nonlinear settings. Although such algorithms enjoy widespread use, their statistical properties are not well understood, either theoretically or empirically. Two inherent problems with these methods are that (1) as in classical hypothesis testing, the value of α is arbitrary, while (2) unlike hypothesis testing, there is no simple analog of type I error rate corresponding to application of the entire algorithm to a data set. In this article we propose a new method, backward elimination via cross-validation (BECV), for test-based variable selection in regression. It is implemented by first finding the empirical p value α*, which minimizes a cross-validation estimate of squared prediction error, then selecting the model by running backward elimination on the entire data set using α* as the nominal p value for each test. We present results of an extensive computer simulation to evaluate BECV and compare its performance to standard backward elimination and forward stepwise selection. 相似文献
970.
Robert J. Gray 《Journal of computational and graphical statistics》2013,22(2):190-207
Abstract This article proposes a method for nonparametric estimation of hazard rates as a function of time and possibly multiple covariates. The method is based on dividing the time axis into intervals, and calculating number of event and follow-up time contributions from the different intervals. The number of event and follow-up time data are then separately smoothed on time and the covariates, and the hazard rate estimators obtained by taking the ratio. Pointwise consistency and asymptotic normality are shown for the hazard rate estimators for a certain class of smoothers, which includes some standard approaches to locally weighted regression and kernel regression. It is shown through simulation that a variance estimator based on this asymptotic distribution is reasonably reliable in practice. The problem of how to select the smoothing parameter is considered, but a satisfactory resolution to this problem has not been identified. The method is illustrated using data from several breast cancer clinical trials. 相似文献