全文获取类型
收费全文 | 3014篇 |
免费 | 346篇 |
国内免费 | 282篇 |
专业分类
化学 | 190篇 |
力学 | 166篇 |
综合类 | 118篇 |
数学 | 2726篇 |
物理学 | 442篇 |
出版年
2024年 | 4篇 |
2023年 | 34篇 |
2022年 | 50篇 |
2021年 | 79篇 |
2020年 | 92篇 |
2019年 | 102篇 |
2018年 | 94篇 |
2017年 | 126篇 |
2016年 | 145篇 |
2015年 | 92篇 |
2014年 | 162篇 |
2013年 | 252篇 |
2012年 | 155篇 |
2011年 | 157篇 |
2010年 | 167篇 |
2009年 | 171篇 |
2008年 | 228篇 |
2007年 | 202篇 |
2006年 | 178篇 |
2005年 | 133篇 |
2004年 | 127篇 |
2003年 | 118篇 |
2002年 | 124篇 |
2001年 | 110篇 |
2000年 | 90篇 |
1999年 | 77篇 |
1998年 | 61篇 |
1997年 | 47篇 |
1996年 | 46篇 |
1995年 | 34篇 |
1994年 | 32篇 |
1993年 | 12篇 |
1992年 | 15篇 |
1991年 | 19篇 |
1990年 | 13篇 |
1989年 | 15篇 |
1988年 | 2篇 |
1987年 | 14篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 9篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1977年 | 1篇 |
1971年 | 1篇 |
1957年 | 1篇 |
1936年 | 2篇 |
排序方式: 共有3642条查询结果,搜索用时 46 毫秒
71.
D. Shakti 《Journal of Difference Equations and Applications》2018,24(7):1185-1196
In this article, we consider a system of nonlinear singularly perturbed differential equations with two different parameters. To solve this system, we develop a weighted monotone hybrid scheme on a nonuniform mesh. The proposed scheme is a combination of the midpoint scheme and the upwind scheme involving the weight parameters. The weight parameters enable the method to switch automatically from the midpoint scheme to the upwind scheme as the nodal points start moving from the inner region to the outer region. The nonuniform mesh in particular the adaptive grid is constructed using the idea of equidistributing a positive monitor function involving the solution gradient. The method is shown to be second order convergent with respect to the small parameters. Numerical experiments are presented to show the robustness of the proposed scheme and indicate that the estimate is optimal. 相似文献
72.
《Journal of computational and graphical statistics》2013,22(4):818-837
Generalized linear mixed models (GLMMs) are often fit by computational procedures such as penalized quasi-likelihood (PQL). Special cases of GLMMs are generalized linear models (GLMs), which are often fit using algorithms like iterative weighted least squares (IWLS). High computational costs and memory space constraints make it difficult to apply these iterative procedures to datasets having a very large number of records. We propose a computationally efficient strategy based on the Gauss–Seidel algorithm that iteratively fits submodels of the GLMM to collapsed versions of the data. The strategy is applied to investigate the relationship between ischemic heart disease, socioeconomic status, and age/gender category in New South Wales, Australia, based on outcome data consisting of approximately 33 million records. For Poisson and binomial regression models, the Gauss–Seidel approach is found to substantially outperform existing methods in terms of maximum analyzable sample size. Remarkably, for both models, the average time per iteration and the total time until convergence of the Gauss–Seidel procedure are less than 0.3% of the corresponding times for the IWLS algorithm. Platform-independent pseudo-code for fitting GLMS, as well as the source code used to generate and analyze the datasets in the simulation studies, are available online as supplemental materials. 相似文献
73.
Lan Lei Xianya Geng Shuchao Li Yingjun Peng Yuantian Yu 《International journal of quantum chemistry》2019,119(24):e26044
Let denote a molecular graph of linear [n] phenylene with n hexagons and n squares, and let the Möbius phenylene chain be the graph obtained from the by identifying the opposite lateral edges in reversed way. Utilizing the decomposition theorem of the normalized Laplacian characteristic polynomial, we study the normalized Laplacian spectrum of , which consists of the eigenvalues of two symmetric matrices ℒ R and ℒ Q of order 3n. By investigating the relationship between the roots and coefficients of the characteristic polynomials of the two matrices above, we obtain an explicit closed-form formula of the multiplicative degree-Kirchhoff index as well as the number of spanning trees of . Furthermore, we determine the limited value for the quotient of the multiplicative degree-Kirchhoff index and the Gutman index of . 相似文献
74.
This article focuses on properties and structures of trees with maximum mean subtree order in a given family; such trees are called optimal in the family. Our main goal is to describe the structure of optimal trees in and , the families of all trees and caterpillars, respectively, of order . We begin by establishing a powerful tool called the Gluing Lemma, which is used to prove several of our main results. In particular, we show that if is an optimal tree in or for , then every leaf of is adjacent to a vertex of degree at least . We also use the Gluing Lemma to answer an open question of Jamison and to provide a conceptually simple proof of Jamison's result that the path has minimum mean subtree order among all trees of order . We prove that if is optimal in , then the number of leaves in is and that if is optimal in , then the number of leaves in is . Along the way, we describe the asymptotic structure of optimal trees in several narrower families of trees. 相似文献
75.
Michael P. Drazin 《代数通讯》2020,48(4):1423-1438
76.
77.
Let E?R be an interval. By studying an admissible family of branching mechanisms{ψt,t ∈E} introduced in Li [Ann. Probab., 42, 41-79(2014)], we construct a decreasing Levy-CRT-valued process {Tt, t ∈ E} by pruning Lévy trees accordingly such that for each t ∈E, Tt is a ψt-Lévy tree. We also obtain an analogous process {Tt*,t ∈E} by pruning a critical Levy tree conditioned to be infinite. Under a regular condition on the admissible family of branching mechanisms, we show that the law of {Tt,t ∈E} at the ascension time A := inf{t ∈E;Tt is finite} can be represented by{Tt*,t∈E}.The results generalize those studied in Abraham and Delmas [Ann. Probab., 40, 1167-1211(2012)]. 相似文献
78.
《Discrete Mathematics》2019,342(6):1564-1576
79.
80.