全文获取类型
收费全文 | 1356篇 |
免费 | 70篇 |
国内免费 | 21篇 |
专业分类
化学 | 43篇 |
力学 | 22篇 |
综合类 | 8篇 |
数学 | 470篇 |
物理学 | 132篇 |
无线电 | 772篇 |
出版年
2024年 | 3篇 |
2023年 | 16篇 |
2022年 | 20篇 |
2021年 | 25篇 |
2020年 | 24篇 |
2019年 | 16篇 |
2018年 | 11篇 |
2017年 | 35篇 |
2016年 | 35篇 |
2015年 | 42篇 |
2014年 | 81篇 |
2013年 | 81篇 |
2012年 | 74篇 |
2011年 | 66篇 |
2010年 | 67篇 |
2009年 | 69篇 |
2008年 | 79篇 |
2007年 | 67篇 |
2006年 | 77篇 |
2005年 | 56篇 |
2004年 | 77篇 |
2003年 | 48篇 |
2002年 | 45篇 |
2001年 | 28篇 |
2000年 | 48篇 |
1999年 | 34篇 |
1998年 | 31篇 |
1997年 | 23篇 |
1996年 | 21篇 |
1995年 | 24篇 |
1994年 | 19篇 |
1993年 | 15篇 |
1992年 | 16篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 6篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1986年 | 4篇 |
1985年 | 8篇 |
1984年 | 8篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 2篇 |
1973年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有1447条查询结果,搜索用时 15 毫秒
31.
Hong Tao Gao Dong Mei Dai Tong Hua Li 《中国化学快报》2007,18(4):495-498
Non-negative matrix factorization(NMF)is a technique for dimensionality reduction by placing non-negativity constraints onthe matrix.Based on the PARAFAC model,NMF was extended for three-dimension data decomposition.The three-dimension non-negative matrix factorization(NMF3)algorithm,which was concise and easy to implement,was given in this paper.The NMF3algorithm implementation was based on elements but not on vectors.It could decompose a data array directly without unfolding,which was not similar to that the traditional algorithms do.It has been applied to the simulated data array decomposition andobtained reasonable results.It showed that NMF3 could be introduced for curve resolution in chemometrics. 相似文献
32.
33.
本文从E序列的组合性质出发,把E序列划分为“组”、“群”和“族”,证明了当序列长度大于等于8时,一“族”E序列的不重复性,进而导出了一种简洁、快速、高效的综合E序列的算法.这种算法对于需要产生大量长E序列的工程问题特别有效. 相似文献
34.
James Renegar 《Mathematical Programming》1985,32(3):319-336
This work examines the computational complexity of a homotopy algorithm in approximating all roots of a complex polynomialf. It is shown that, probabilistically, monotonic convergence to each of the roots occurs after a determined number of steps. Moreover, in all subsequent steps, each rootz is approximated by a complex numberx, where ifx
0 =x, x
j
=x
j–1 –f(x
j–1)/f(x
j–1),j = 1, 2,, then |x
j
–z| < (1/|x
0 –z|)|x
j–1–z|2. 相似文献
35.
一种有机质谱谱图的库检索新算法 总被引:1,自引:0,他引:1
一种有机质谱谱图的库检索新算法律祥俊,林少凡,张金碚,张法义(南开大学中心实验室,天津,300071)关键词检索,算法,质谱,数据库利用计算机匹配技术识别有机质谱谱图中的库检索方法仅需用低分辨质谱图即可识别未知化合物,似为最成功的方法[1~3].质谱... 相似文献
36.
A primal transportation algorithm is devised via post-optimization on the costs of a modified problem. The procedure involves altering the costs corresponding to the basic cells of the initial (primal feasible) solution so that it is dual feasible as well. The altered costs are then successively restored to their true values with appropriate changes in the optimal solution by the application of cell or area cost operators discussed elsewhere. The cell cost operator algorithm converges to optimum within (2T – 1) steps for primal nondegenerate transportation problems and [(2T + 1) min (m, n)] – 1 steps for primal degenerate transportation problems, whereT is the sum of the (integer) warehouse availabilities (also the sum of the (integer) market requirements) andm andn denote the number of warehouses and markets respectively. For the area cost operator algorithm the corresponding bounds on the number of steps areT and (T + 1) min (m, n) respectively.This report was prepared as part of the activities of the Management Sciences Research Group, Carnegie—Mellon University, under Contract N00014-67-A-0314-0007 NR 047-048 with the U.S. Office of Naval Research. 相似文献
37.
38.
New uniform algorithm to predict reversed phase retention values under different gradient conditions
Wang Longxing 《Analytica chimica acta》2003,476(1):123-129
A new numerical emulation algorithm was established to calculate retention parameters in RP-HPLC with several retention times under different linear or nonlinear binary gradient elution conditions and further predict the retention time under any other binary gradient conditions. A program was written according to this algorithm and nine solutes were used to test the program. The prediction results were excellent. The maximum relative error of predicted retention time was less than 0.45%. 相似文献
39.
J. Zhu 《Mathematical Methods of Operations Research》1992,36(4):359-377
We present a primal-dual path following interior algorithm for a class of linearly constrained convex programming problems with non-negative decision variables. We introduce the definition of a Scaled Lipschitz Condition and show that if the objective function satisfies the Scaled Lipschitz Condition then, at each iteration, our algorithm reduces the duality gap by at least a factor of (1–/n), where is positive and depends on the curvature of the objective function, by means of solving a system of linear equations which requires no more than O(n3) arithmetic operations. The class of functions having the Scaled Lipschitz Condition includes linear, convex quadratic and entropy functions. 相似文献
40.
本文基于显式组播(Explicit Multicast)机制和遗传算法的思想,提出了一种通过减少组播组中存放转发信息的路由节点数量来减轻路由路径负担的策略。通过算法描述和分析及实验仿真,此方案可以有效地节省网络资源。 相似文献