全文获取类型
收费全文 | 931篇 |
免费 | 52篇 |
国内免费 | 87篇 |
专业分类
化学 | 73篇 |
力学 | 11篇 |
综合类 | 19篇 |
数学 | 914篇 |
物理学 | 53篇 |
出版年
2023年 | 11篇 |
2022年 | 15篇 |
2021年 | 19篇 |
2020年 | 19篇 |
2019年 | 36篇 |
2018年 | 39篇 |
2017年 | 43篇 |
2016年 | 40篇 |
2015年 | 19篇 |
2014年 | 38篇 |
2013年 | 127篇 |
2012年 | 23篇 |
2011年 | 41篇 |
2010年 | 43篇 |
2009年 | 53篇 |
2008年 | 53篇 |
2007年 | 35篇 |
2006年 | 44篇 |
2005年 | 43篇 |
2004年 | 39篇 |
2003年 | 37篇 |
2002年 | 35篇 |
2001年 | 27篇 |
2000年 | 40篇 |
1999年 | 23篇 |
1998年 | 22篇 |
1997年 | 20篇 |
1996年 | 12篇 |
1995年 | 5篇 |
1994年 | 10篇 |
1993年 | 5篇 |
1992年 | 5篇 |
1991年 | 6篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1974年 | 1篇 |
1973年 | 2篇 |
1948年 | 1篇 |
排序方式: 共有1070条查询结果,搜索用时 15 毫秒
21.
Thordis L. Thorarinsdottir Michael Scheuerer Christopher Heinz 《Journal of computational and graphical statistics》2016,25(1):105-122
Any decision-making process that relies on a probabilistic forecast of future events necessarily requires a calibrated forecast. This article proposes new methods for empirically assessing forecast calibration in a multivariate setting where the probabilistic forecast is given by an ensemble of equally probable forecast scenarios. Multivariate properties are mapped to a single dimension through a prerank function and the calibration is subsequently assessed visually through a histogram of the ranks of the observation’s preranks. Average ranking assigns a prerank based on the average univariate rank while band depth ranking employs the concept of functional band depth where the centrality of the observation within the forecast ensemble is assessed. Several simulation examples and a case study of temperature forecast trajectories at Berlin Tegel Airport in Germany demonstrate that both multivariate ranking methods can successfully detect various sources of miscalibration and scale efficiently to high-dimensional settings. Supplemental material in form of computer code is available online. 相似文献
22.
23.
24.
Ajit A. Diwan 《Discrete Mathematics》2019,342(4):1060-1062
Let be a perfect matching in a graph. A subset of is said to be a forcing set of , if is the only perfect matching in the graph that contains . The minimum size of a forcing set of is called the forcing number of . Pachter and Kim (1998) conjectured that the forcing number of every perfect matching in the -dimensional hypercube is , for all . This was revised by Riddle (2002), who conjectured that it is at least , and proved it for all even . We show that the revised conjecture holds for all . The proof is based on simple linear algebra. 相似文献
25.
26.
In this paper, the authors consider the asymptotic synchronization of a linear dissipative system with multiple feedback dampings. They ?rst show that under the observability of a scalar equation, Kalman’s rank condition is su?cient for the uniqueness of solution to a complex system of elliptic equations with mixedobservations. The authors then establish a general theory on the asymptotic stability and the asymptotic synchronization for the corresponding evolutional system subjected to mixed dampings of various natures. Some classic models are presented to illustrate the ?eld of applications of the abstract theory. 相似文献
27.
Magdy H. Metry Allan R. Sampson 《Journal of computational and graphical statistics》2013,22(2):209-223
Abstract This article introduces an approach for characterizing the classes of empirical distributions that satisfy certain positive dependence notions. Mathematically, this can be expressed as studying certain subsets of the class SN of permutations of 1, …, N, where each subset corresponds to some positive dependence notions. Explicit techniques for it-eratively characterizing subsets of SN that satisfy certain positive dependence concepts are obtained and various counting formulas are given. Based on these techniques, graph-theoretic methods are used to introduce new and more efficient algorithms for constructively generating and enumerating the elements of various of these subsets of SN. For example, the class of positively quadrant dependent permutations in SN is characterized in this fashion. 相似文献
28.
Aziza Rezig 《代数通讯》2018,46(3):1344-1352
A group is called (PF)L if the subgroups generated by its elements having same order (finite or infinite) are polycyclic-by-finite. In the present paper we prove that a group is locally graded minimal non-((PF)L∪(𝔓𝔉)𝔄) if, and only if, it is non-perfect minimal non-FC, where (𝔓𝔉)𝔄 denotes the class of (polycyclic-by-finite)-by-abelian groups. We prove also that a group of infinite rank whose proper subgroups of infinite rank are in ((PF)L∪(𝔓𝔉)𝔄) is itself in ((PF)L∪(𝔓𝔉)𝔄) provided that it is locally (soluble-by-finite) without simple homomorphic images of infinite rank. Our last result concerns groups that satisfy the minimal condition on non-((PF)L∪(𝔓𝔉)𝔄)-subgroups. 相似文献
29.
对于pair-copula中的参数估计,大多假设copula函数的参数和条件变量独立,将参数简化成一个不依赖于条件变量的常数.本文假设copula函数的参数和条件变量不独立,该参数是以条件变量为自变量的一元函数.应用该方法实证分析了“克强指数”三个指标铁路货运量、工业用电量和贷款发放量的对数增长率之间的关系,研究发现该方法优于简化的pair-copula参数估计,并且得出在固定铁路货运量不变时,工业用电量和银行贷款发放量成负相关关系,且这种负相关性随铁路货运量增加而减弱. 相似文献
30.
m次幂等矩阵的等价条件 总被引:1,自引:0,他引:1
陈益智 《数学的实践与认识》2011,41(23)
利用矩阵的秩和齐次线性方程组解空间的维数,给出了m(m≥2)次幂等矩阵的一些等价条件,推广了2,3次幂等矩阵的相应结果.此外,所获结果还给推广到了m次幂等线性变换中. 相似文献