全文获取类型
收费全文 | 1568篇 |
免费 | 267篇 |
国内免费 | 75篇 |
专业分类
化学 | 143篇 |
晶体学 | 18篇 |
力学 | 122篇 |
综合类 | 56篇 |
数学 | 806篇 |
物理学 | 765篇 |
出版年
2024年 | 1篇 |
2023年 | 19篇 |
2022年 | 43篇 |
2021年 | 43篇 |
2020年 | 46篇 |
2019年 | 49篇 |
2018年 | 40篇 |
2017年 | 79篇 |
2016年 | 85篇 |
2015年 | 56篇 |
2014年 | 121篇 |
2013年 | 114篇 |
2012年 | 67篇 |
2011年 | 87篇 |
2010年 | 86篇 |
2009年 | 105篇 |
2008年 | 109篇 |
2007年 | 113篇 |
2006年 | 90篇 |
2005年 | 95篇 |
2004年 | 64篇 |
2003年 | 55篇 |
2002年 | 42篇 |
2001年 | 47篇 |
2000年 | 40篇 |
1999年 | 26篇 |
1998年 | 29篇 |
1997年 | 23篇 |
1996年 | 27篇 |
1995年 | 18篇 |
1994年 | 10篇 |
1993年 | 12篇 |
1992年 | 10篇 |
1991年 | 9篇 |
1990年 | 7篇 |
1989年 | 3篇 |
1988年 | 9篇 |
1987年 | 6篇 |
1986年 | 3篇 |
1985年 | 3篇 |
1984年 | 10篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1977年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有1910条查询结果,搜索用时 312 毫秒
101.
Rita Giuliano Claudio Macci Barbara Pacchiarotti 《Journal of Mathematical Analysis and Applications》2014
In this paper we study some sequences of weighted means of continuous real valued Gaussian processes. More precisely we consider suitable generalizations of both arithmetic and logarithmic means of a Gaussian process with covariance function which satisfies either an exponential decay condition or a power decay condition. Our aim is to provide limits of variances of functionals of such weighted means which allow the application of some large deviation results in the literature. 相似文献
102.
We deal with the covariance and cross covariance operators estimation of a Hilbert space valued autoregressive process with random coefficients. We establish bounds for empirical estimators in mean square error and almost sure convergence in Hilbert–Schmidt norm. Consistent estimators of the eigenvalues are also derived. 相似文献
103.
104.
The edit distance problem for rooted unordered trees is known to be NP-hard. Based on this fact, this paper studies exponential-time algorithms for the problem. For a general case, an time algorithm is presented, where and are the numbers of nodes and and are the numbers of branching nodes in two input trees. This algorithm is obtained by a combination of dynamic programming, exhaustive search, and maximum weighted bipartite matching. For bounded degree trees over a fixed alphabet, it is shown that the problem can be solved in time for any fixed . This result is achieved by avoiding duplicate calculations for identical subsets of small subtrees. 相似文献
105.
Deciding whether a given pattern is over- or under-represented according to a given background model is a key question in computational biology. Such a decision is usually made by computing some p-values reflecting the “exceptionality” of a pattern in a given sequence or set of sequences. In the simplest cases (short and simple patterns, simple background model, small number of sequences), an exact p-value can be computed with a tractable complexity. The realistic cases are in general too complicated to get such an exact p-value. Approximations are thus proposed (Gaussian, Poisson, Large deviation approximations). These approximations are applicable under some conditions: Gaussian approximations are valid in the central domain while Poisson and Large deviation approximations are valid for rare events. In the present paper, we prove a large deviation approximation to the double strands counting problem that refers to a counting of a given pattern in a set of sequences that arise from both strands of the genome. In that case, dependencies between a sequence and its reverse complement cannot be neglected. They are captured here for a Bernoulli model from general combinatorial properties of the pattern. A large deviation result is also provided for a set of small sequences. 相似文献
106.
Wei Dan 《中国科学 数学(英文版)》2014,57(10):2179-2188
Orthogonal multi-matching pursuit(OMMP)is a natural extension of orthogonal matching pursuit(OMP)in the sense that N(N≥1)indices are selected per iteration instead of 1.In this paper,the theoretical performance of OMMP under the restricted isometry property(RIP)is presented.We demonstrate that OMMP can exactly recover any K-sparse signal from fewer observations y=φx,provided that the sampling matrixφsatisfiesδKN-N+1+(K/N)~(1/2)θKN-N+1,N1.Moreover,the performance of OMMP for support recovery from noisy observations is also discussed.It is shown that,for l_2 bounded and l_∞bounded noisy cases,OMMP can recover the true support of any K-sparse signal under conditions on the restricted isometry property of the sampling matrixφand the minimum magnitude of the nonzero components of the signal. 相似文献
107.
Let G be a graph. The Hosoya index Z(G) of a graph G is defined to be the total number of its matchings. In this paper, we characterize the graph with the smallest Hosoya index of bicyclic graphs with given pendent vertices. Finally, we present a new proof about the smallest Hosoya index of bicyclic graphs. 相似文献
108.
手写体识别中,目标形状的匹配是较为重要的工作.为了提高手写体目标形状的匹配速度,提出一种新的匹配方法.由于手写体目标形状的几何先验知识已知,并可以采用少量的参数进行表示,新方法采用参数化可变形模板匹配目标形状,确定其后验概率模型,并定义剪枝信任度空间,依据信任度传播算法的特性,首次将剪枝信任度传播算法应用于求解可变形模板与目标形状之间的最佳匹配.实验结果显示,在灰度图像中,对手写体目标形状的轮廓检测与定位速度显著提高.提出将剪枝信任度传播方法应用于手写体目标形状的匹配工作,能够使得目标形状填补空白,应用于相关性较为稀疏的图模型中. 相似文献
109.
110.