全文获取类型
收费全文 | 19378篇 |
免费 | 2651篇 |
国内免费 | 544篇 |
专业分类
化学 | 755篇 |
晶体学 | 14篇 |
力学 | 1032篇 |
综合类 | 324篇 |
数学 | 5493篇 |
物理学 | 2812篇 |
无线电 | 12143篇 |
出版年
2024年 | 75篇 |
2023年 | 254篇 |
2022年 | 445篇 |
2021年 | 523篇 |
2020年 | 518篇 |
2019年 | 445篇 |
2018年 | 461篇 |
2017年 | 657篇 |
2016年 | 873篇 |
2015年 | 886篇 |
2014年 | 1425篇 |
2013年 | 1334篇 |
2012年 | 1366篇 |
2011年 | 1490篇 |
2010年 | 1033篇 |
2009年 | 1176篇 |
2008年 | 1306篇 |
2007年 | 1359篇 |
2006年 | 1141篇 |
2005年 | 948篇 |
2004年 | 799篇 |
2003年 | 696篇 |
2002年 | 601篇 |
2001年 | 465篇 |
2000年 | 419篇 |
1999年 | 310篇 |
1998年 | 294篇 |
1997年 | 243篇 |
1996年 | 216篇 |
1995年 | 149篇 |
1994年 | 103篇 |
1993年 | 113篇 |
1992年 | 98篇 |
1991年 | 43篇 |
1990年 | 55篇 |
1989年 | 34篇 |
1988年 | 39篇 |
1987年 | 23篇 |
1986年 | 30篇 |
1985年 | 33篇 |
1984年 | 30篇 |
1983年 | 10篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
一类非线性单调型方程的区域分裂法 总被引:1,自引:0,他引:1
本文考虑了一类非线性单调问题的加性Schwgrz交替法和异步平行算法,并得到了在能量模意义下的收敛性结果,最后还讨论了格式的有限元离散。 相似文献
42.
Jiang Taihui 《电子科学学刊(英文版)》1996,13(4):325-332
In this paper, an adaptive line spectral pair filter is derived from an adaptive lattice filter. A least-mean-square(LMS) type adaptive algorithm used to calculate directly the line spectral pair(LSP) coefficients on a stage-by-stage basis is presented. Experimental results show that the algorithm has higher convergence rate and lower misadjustment as compared with the other algorithms. The LSP coefficients calculated by the algorithm have been used to carry out speech linear predictive synthesis, resulting in better results than PARCOR coefficients. 相似文献
43.
H. Safiri M. Ahmadi G.A. Jullien W.C. Miller 《The Journal of VLSI Signal Processing》2002,31(2):91-100
A new algorithm based on Genetic Programming (GP) for the problem of optimization of Multiple constant Multiplication (MCM) by Common Subexpression Elimination(CSE) is developed. This method is used for hardware optimization for DSP systems. A solution based on Genetic Programming is shown in this paper. The performance of the technique is demonstrated in one- and multi-dimensional digital filters with constant coefficients. 相似文献
44.
戴伏生 《数学的实践与认识》2006,36(2):186-192
经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性. 相似文献
45.
46.
E. Mathieu Y. Foucher P. Dellamonica J. P. Daures 《Methodology and Computing in Applied Probability》2007,9(3):389-397
In AIDS control, physicians have a growing need to use pragmatically useful and interpretable tools in their daily medical
taking care of patients. Semi-Markov process seems to be well adapted to model the evolution of HIV-1 infected patients. In
this study, we introduce and define a non homogeneous semi-Markov (NHSM) model in continuous time. Then the problem of finding
the equations that describe the biological evolution of patient is studied and the interval transition probabilities are computed.
A parametric approach is used and the maximum likelihood estimators of the process are given. A Monte Carlo algorithm is presented
for realizing non homogeneous semi-Markov trajectories. As results, interval transition probabilities are computed for distinct
times and follow-up has an impact on the evolution of patients.
相似文献
47.
一种改进的共同进化遗传算法及其应用 总被引:2,自引:0,他引:2
将共同进化遗传算法应用于临床营养决策优化中,虽然取得了一定成果,但算法中仍存在早熟现象、局部搜索能量弱等问题,为此提出一种改进的共同进化模型。算法使用新的子群体划分方法和交叉算子,引入精英保留策略、信息交换原则和小生境技术。通过对糖尿病营养治疗的仿真表明,改进后的算法在保证群体多样性和避免早熟现象的前提下,提高了算法的局部和全局寻优能力,且膳食配方中营养素达标率符合要求,满足专家建议的糖尿病饮食需求。 相似文献
48.
Bing-sheng He Zhen-hua Yang Xiao-ming Yuan 《Journal of Mathematical Analysis and Applications》2004,300(2):139-374
Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method. 相似文献
49.
Shunsuke Inenaga Ayumi Shinohara Masayuki Takeda Setsuo Arikawa 《Journal of Discrete Algorithms》2004,2(1):33
Suffix trees are a well-known and widely-studied data structure highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain suffix trees for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. Compact directed acyclic word graphs (CDAWGs) are a more space-economical data structure for indexing strings. In this paper we propose a linear-time algorithm to maintain CDAWGs for a sliding window. 相似文献
50.
Gabriela Jeronimo Teresa Krick Juan Sabia Martín Sombra 《Foundations of Computational Mathematics》2004,4(1):41-117
We present a bounded probability algorithm for the computation of the
Chowforms of the equidimensional components of an algebraic variety. In particular,
this gives an alternative procedure for the effective equidimensional decomposition
of the variety, since each equidimensional component is characterized by its Chow
form.
The expected complexity of the algorithm is polynomial in the size and the geometric
degree of the input equation system defining the variety. Hence it improves (or
meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects,
which constitutes a further contribution of the paper.
The algorithm is based on elimination theory techniques, in line with the geometric
resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators.
In fact, ours can be considered as an extension of their algorithm for zero-dimensional
systems to the case of positive-dimensional varieties. The key element for dealing
with positive-dimensional varieties is a new Poisson-type product formula. This
formula allows us to compute the Chow form of an equidimensional variety from a
suitable zero-dimensional fiber.
As an application, we obtain an algorithm to compute a subclass of sparse resultants,
whose complexity is polynomial in the dimension and the volume of the input
set of exponents. As another application, we derive an algorithm for the computation
of the (unique) solution of a generic overdetermined polynomial equation system. 相似文献