全文获取类型
收费全文 | 8739篇 |
免费 | 1107篇 |
国内免费 | 343篇 |
专业分类
化学 | 746篇 |
晶体学 | 13篇 |
力学 | 1009篇 |
综合类 | 324篇 |
数学 | 5485篇 |
物理学 | 2612篇 |
出版年
2024年 | 16篇 |
2023年 | 86篇 |
2022年 | 222篇 |
2021年 | 263篇 |
2020年 | 183篇 |
2019年 | 195篇 |
2018年 | 221篇 |
2017年 | 332篇 |
2016年 | 438篇 |
2015年 | 282篇 |
2014年 | 534篇 |
2013年 | 585篇 |
2012年 | 480篇 |
2011年 | 536篇 |
2010年 | 423篇 |
2009年 | 562篇 |
2008年 | 580篇 |
2007年 | 594篇 |
2006年 | 476篇 |
2005年 | 428篇 |
2004年 | 372篇 |
2003年 | 312篇 |
2002年 | 292篇 |
2001年 | 248篇 |
2000年 | 223篇 |
1999年 | 194篇 |
1998年 | 179篇 |
1997年 | 158篇 |
1996年 | 134篇 |
1995年 | 104篇 |
1994年 | 71篇 |
1993年 | 82篇 |
1992年 | 71篇 |
1991年 | 38篇 |
1990年 | 44篇 |
1989年 | 28篇 |
1988年 | 30篇 |
1987年 | 23篇 |
1986年 | 29篇 |
1985年 | 29篇 |
1984年 | 28篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
971.
We consider polynomials orthogonal relative to a sequence of vectors and derive their recurrence relations within the framework
of Clifford algebras. We state sufficient conditions for the existence of a system of such polynomials. The coefficients in
the above relations may be computed using a cross-rule which is linked to a vector version of the quotient-difference algorithm,
both of which are proved here using designants. An alternative route is to employ a vector variant of the Chebyshev algorithm.
This algorithm is established and an implementation presented which does not require general Clifford elements. Finally, we
comment on the connection with vector Padé approximants.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
972.
In a previous paper by the second author, two Markov chain Monte Carlo perfect sampling algorithms—one called coupling from the past (CFTP) and the other (FMMR) based on rejection sampling—are compared using as a case study the move‐to‐front (MTF) self‐organizing list chain. Here we revisit that case study and, in particular, exploit the dependence of FMMR on the user‐chosen initial state. We give a stochastic monotonicity result for the running time of FMMR applied to MTF and thus identify the initial state that gives the stochastically smallest running time; by contrast, the initial state used in the previous study gives the stochastically largest running time. By changing from worst choice to best choice of initial state we achieve remarkable speedup of FMMR for MTF; for example, we reduce the running time (as measured in Markov chain steps) from exponential in the length n of the list nearly down to n when the items in the list are requested according to a geometric distribution. For this same example, the running time for CFTP grows exponentially in n. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003 相似文献
973.
APPROXIMATION ALGORITHM FOR MAX-BISECTION PROBLEM WITH THE POSITIVE SEMIDEFINITE RELAXATION 总被引:1,自引:0,他引:1
Da-chuan Xu Ji-ye Han 《计算数学(英文版)》2003,(3)
Using outward rotations, we obtain an approximation algorithm for Max-Bisection problem, i.e., partitioning the vertices of an undirected graph into two blocks of equal cardinality so as to maximize the weights of crossing edges. In many interesting cases, the algorithm performs better than the algorithms of Ye and of Halperin and Zwick. The main tool used to obtain this result is semidefinite programming. 相似文献
974.
AN ALGORITHM FOR JORDAN CANONICAL FORM OF A QUATERNION MATRIX 总被引:2,自引:0,他引:2
In this paper, we first introduce a concept of companion vector, and study the Jordan canonical forms of quaternion matrices by using the methods of complex rep resentation and companion vector, not only give out a practical algorithm for Jordan canonical form J of a quaternion matrix A, but also provide a practical algorithm for corresponding nonsingular matrix P with P-1AP = J. 相似文献
975.
976.
Mallat‘s decompositon and reconstruction algorithms are very important in the the field of wavelet theory and its applications to signal processing.Wavelet Anal-ysis,which is based on L^2(R) space,can eliminate redundancy of signals with the help of orthogonality and characterize the processing precision with the meansquare error.In the recent years,it is understood that the mean square measuredoes not match human visual sensitivity well.From the point of view,R.DeVore studied L^1 measure instead.Similarly,considering the principles of image com-pression,Yang introduced and dealt with orthogonality in L^1 space based on thebest approximation theory,and consequently established the corresponding decom-position and reconstruction algorithms for signals.In this paper,error analyses for the algorithms above are taken and the selection of the best parameters in the algorithms are discussed in detail.Finally,the algorithms are compared with the classical Haar and Daubechies‘‘s orthogonal wavelets based on the singal-to-noiseratio data computed. 相似文献
977.
讨论了空间有理曲线中心投影后导数上界的估计,基于曲线各阶差分的递推计算,给出了空间有理参数多项式曲线的快速绘制算法.算法只用到整数的加减法,效率高. 相似文献
978.
水资源可再生能力综合评价的遗传加权物元模型 总被引:6,自引:0,他引:6
为了科学地计算水资源可再生能力评价指标的权重 ,使评价方法具有可操作性 ,采用主、客观相结合的赋权基点法 ,以全局收敛的格雷码加速遗传算法为工具来确定权重 ,并结合物元分析理论 ,建立了一种新的评价模型——遗传加权物元模型 .文中给出了该模型实施的详细步骤 ,对黄河流域 9个行政分区的水资源可再生能力进行了综合评价 ,取得了较好的效果 . 相似文献
979.
基于加强型BP算法的神经网络故障诊断研究 总被引:4,自引:0,他引:4
文章给出了利用神经网络进行故障诊断的可行性、基本原理、诊断过程分析、和参数优化过程 ,并得出较为理想的诊断结果 . 相似文献
980.
在薄膜的光学参数拟合时,操作者给定的模型初值对拟合结果有很大的关系。采用广泛用于求解复杂系统优化问题的模拟退火算法来求解薄膜光学常数,降低了操作者给定拟合模型初值的要求。通过对常规的模拟退火算法以及非常快速的模拟退火方法(Very Fast Stimulated Annealing,VFSA)分析,针对性地在模型扰动及退火计划上存在的缺陷作了改进,提高了VFSA算法的计算稳健性。通过大量的拟合实践,验证了提出的改进模拟退火方法的有效性。 相似文献