全文获取类型
收费全文 | 3291篇 |
免费 | 384篇 |
国内免费 | 204篇 |
专业分类
化学 | 369篇 |
晶体学 | 5篇 |
力学 | 238篇 |
综合类 | 73篇 |
数学 | 1513篇 |
物理学 | 654篇 |
无线电 | 1027篇 |
出版年
2024年 | 9篇 |
2023年 | 35篇 |
2022年 | 76篇 |
2021年 | 92篇 |
2020年 | 81篇 |
2019年 | 71篇 |
2018年 | 86篇 |
2017年 | 105篇 |
2016年 | 139篇 |
2015年 | 113篇 |
2014年 | 235篇 |
2013年 | 260篇 |
2012年 | 199篇 |
2011年 | 201篇 |
2010年 | 154篇 |
2009年 | 183篇 |
2008年 | 197篇 |
2007年 | 174篇 |
2006年 | 173篇 |
2005年 | 154篇 |
2004年 | 139篇 |
2003年 | 132篇 |
2002年 | 103篇 |
2001年 | 104篇 |
2000年 | 86篇 |
1999年 | 81篇 |
1998年 | 67篇 |
1997年 | 67篇 |
1996年 | 47篇 |
1995年 | 35篇 |
1994年 | 35篇 |
1993年 | 30篇 |
1992年 | 29篇 |
1991年 | 21篇 |
1990年 | 28篇 |
1989年 | 15篇 |
1988年 | 16篇 |
1987年 | 12篇 |
1986年 | 4篇 |
1985年 | 9篇 |
1984年 | 15篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 12篇 |
1980年 | 14篇 |
1979年 | 12篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 2篇 |
1973年 | 3篇 |
排序方式: 共有3879条查询结果,搜索用时 15 毫秒
1.
Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers 下载免费PDF全文
Youssouf Ould‐Cheikh‐Mouhamedou 《International Journal of Communication Systems》2015,28(9):1572-1579
The knowledge of turbo code's minimum Hamming distance (dmin) and its corresponding codeword multiplicity (Amin) is of a great importance because the error correction capability of a code is strongly tied to the values of dmin and Amin. Unfortunately, the computational complexity associated with the search for dmin and Amin can be very high, especially for a turbo code that has high dmin value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of dmin and Amin values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd. 相似文献
2.
In this paper, we study the existence of the uniformly minimum risk equivariant (UMRE) estimators of parameters in a class
of normal linear models, which include the normal variance components model, the growth curve model, the extended growth curve
model, and the seemingly unrelated regression equations model, and so on. The necessary and sufficient conditions are given
for the existence of UMRE estimators of the estimable linear functions of regression coefficients, the covariance matrixV and (trV)α, where α > 0 is known, in the models under an affine group of transformations for quadratic losses and matrix losses, respectively.
Under the (extended) growth curve model and the seemingly unrelated regression equations model, the conclusions given in literature
for estimating regression coefficients can be derived by applying the general results in this paper, and the sufficient conditions
for non-existence of UMRE estimators ofV and tr(V) are expanded to be necessary and sufficient conditions. In addition, the necessary and sufficient conditions that there
exist UMRE estimators of parameters in the variance components model are obtained for the first time. 相似文献
3.
关于AOR迭代法的研究 总被引:5,自引:0,他引:5
陈恒新 《应用数学与计算数学学报》2002,16(1):40-46
本文论证了严格对角占优矩阵之AOR法的误差估计式中的误差估计常数hγ,ω(0≤γ≤ω0)的最小值是h1,1. 相似文献
4.
图G称为K1,n-free图,如果它不含K1,n作为其导出子图.对K1,n-free图具有给定性质的[a,b]-因子涉及到最小度条件进行了研究,得到一个充分条件. 相似文献
5.
6.
1 IntroductionThestickingpointofassociationrulealgorithmsdependsoneffectivelyfindingallcorrelationpatternsthatsatisfyvaluerequirementinthemagnanimityofdata.Butthealgorithmsalsobringanegativeef fect:thenumberofassociationrulesisverylarge.Alsoinformation… 相似文献
7.
Jeannette H. C. Woerner 《商业与工业应用随机模型》2005,21(1):27-44
In the framework of stochastic volatility models we examine estimators for the integrated volatility based on the pth power variation (i.e. the sum of pth absolute powers of the log‐returns). We derive consistency and distributional results for the estimators given high‐frequency data, especially taking into account what kind of process we may add to our model without affecting the estimate of the integrated volatility. This may on the one hand be interpreted as a possible flexibility in modelling, for example adding jumps or even leaving the framework of semimartingales by adding a fractional Brownian motion, or on the other hand as robustness against model misspecification. We will discuss possible choices of p under different model assumptions and irregularly spaced data. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
8.
9.
10.
The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large. 相似文献