全文获取类型
收费全文 | 3714篇 |
免费 | 541篇 |
国内免费 | 243篇 |
专业分类
化学 | 215篇 |
晶体学 | 1篇 |
力学 | 120篇 |
综合类 | 44篇 |
数学 | 2025篇 |
物理学 | 821篇 |
无线电 | 1272篇 |
出版年
2024年 | 15篇 |
2023年 | 60篇 |
2022年 | 108篇 |
2021年 | 142篇 |
2020年 | 145篇 |
2019年 | 117篇 |
2018年 | 166篇 |
2017年 | 180篇 |
2016年 | 201篇 |
2015年 | 170篇 |
2014年 | 238篇 |
2013年 | 315篇 |
2012年 | 192篇 |
2011年 | 185篇 |
2010年 | 145篇 |
2009年 | 189篇 |
2008年 | 211篇 |
2007年 | 201篇 |
2006年 | 176篇 |
2005年 | 173篇 |
2004年 | 116篇 |
2003年 | 127篇 |
2002年 | 127篇 |
2001年 | 113篇 |
2000年 | 116篇 |
1999年 | 79篇 |
1998年 | 81篇 |
1997年 | 75篇 |
1996年 | 60篇 |
1995年 | 39篇 |
1994年 | 29篇 |
1993年 | 20篇 |
1992年 | 26篇 |
1991年 | 17篇 |
1990年 | 15篇 |
1989年 | 7篇 |
1988年 | 15篇 |
1987年 | 11篇 |
1986年 | 8篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 8篇 |
1982年 | 12篇 |
1981年 | 4篇 |
1980年 | 10篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1974年 | 3篇 |
排序方式: 共有4498条查询结果,搜索用时 31 毫秒
1.
In this paper, we strive to propose a self-interpretable framework, termed PrimitiveTree, that incorporates deep visual primitives condensed from deep features with a conventional decision tree, bridging the gap between deep features extracted from deep neural networks (DNNs) and trees’ transparent decision-making processes. Specifically, we utilize a codebook, which embeds the continuous deep features into a finite discrete space (deep visual primitives) to distill the most common semantic information. The decision tree adopts the spatial location information and the mapped primitives to present the decision-making process of the deep features in a tree hierarchy. Moreover, the trained interpretable PrimitiveTree can inversely explain the constituents of the deep features, highlighting the most critical and semantic-rich image patches attributing to the final predictions of the given DNN. Extensive experiments and visualization results validate the effectiveness and interpretability of our method. 相似文献
2.
3.
4.
《Journal of Pure and Applied Algebra》2022,226(8):107024
We solve a combinatorial question concerning eigenvalues of the universal intertwining endomorphism of a subset representation. 相似文献
5.
6.
Yasoub Eghbali Mahmoud Ferdosizade Naeiny 《International Journal of Communication Systems》2020,33(14)
In this paper, an off‐grid direction of arrival (DoA) estimation method is proposed for wideband signals. This method is based on the sparse representation (SR) of the array covariance matrix. Similar to the time domain DoA estimation methods, the correlation function of the sources was assumed to be the same and known. A new measurement vector is obtained using the lower‐left triangular elements of the covariance matrix. The DoAs are estimated by quantizing the entire range of continuous angle space into discrete grid points. However, the exact DoAs may be located between two grid points; therefore, this estimation has errors. The accuracy of DoA estimation is improved by the minimization of the difference between the new measurement vector and its estimated values. Simulation results revealed that the proposed method can enhance the DoA estimation accuracy of wideband signals. 相似文献
7.
《Indagationes Mathematicae》2022,33(1):218-237
We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic , and with coefficients in a field of odd characteristic ): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols. 相似文献
8.
本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的. 相似文献
9.
Ieva
Dauickait Amos S. Lawless Jennifer A. Scott Peter Jan van Leeuwen 《Numerical Linear Algebra with Applications》2020,27(5)
We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds. 相似文献
10.
The finiteness is proved of the set of isomorphism classes of potentially abelian geometric Galois representations with a given set of data. This is a special case of the finiteness conjecture of Fontaine and Mazur. 相似文献