全文获取类型
收费全文 | 24591篇 |
免费 | 2078篇 |
国内免费 | 1773篇 |
专业分类
化学 | 762篇 |
晶体学 | 13篇 |
力学 | 1016篇 |
综合类 | 333篇 |
数学 | 5517篇 |
物理学 | 2981篇 |
综合类 | 17820篇 |
出版年
2024年 | 136篇 |
2023年 | 312篇 |
2022年 | 587篇 |
2021年 | 654篇 |
2020年 | 536篇 |
2019年 | 549篇 |
2018年 | 559篇 |
2017年 | 769篇 |
2016年 | 804篇 |
2015年 | 822篇 |
2014年 | 1318篇 |
2013年 | 1289篇 |
2012年 | 1420篇 |
2011年 | 1580篇 |
2010年 | 1186篇 |
2009年 | 1488篇 |
2008年 | 1543篇 |
2007年 | 1965篇 |
2006年 | 1766篇 |
2005年 | 1453篇 |
2004年 | 1259篇 |
2003年 | 1023篇 |
2002年 | 888篇 |
2001年 | 731篇 |
2000年 | 603篇 |
1999年 | 543篇 |
1998年 | 475篇 |
1997年 | 407篇 |
1996年 | 321篇 |
1995年 | 265篇 |
1994年 | 197篇 |
1993年 | 191篇 |
1992年 | 160篇 |
1991年 | 113篇 |
1990年 | 122篇 |
1989年 | 88篇 |
1988年 | 79篇 |
1987年 | 59篇 |
1986年 | 40篇 |
1985年 | 37篇 |
1984年 | 28篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1955年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 93 毫秒
181.
Huang H. X. Liang Z. A. Pardalos P. M. 《Journal of Optimization Theory and Applications》2004,120(1):53-71
A flow search approach is presented in this paper. In the approach, each iterative process involves a subproblem, whose variables are the stepsize parameters. Every feasible solution of the subproblem corresponds to some serial search stages, the stepsize parameters in different search stages may interact mutually, and their optimal values are determined by evaluating the total effect of the interaction. The main idea of the flow search approach is illustrated via the minimization of a convex quadratic function. Based on the flow search approach, some properties of the m-step linear conjugate gradient algorithm are analyzed and new bounds on its convergence rate are also presented. Theoretical and numerical results indicate that the new bounds are better than the well-known ones. 相似文献
182.
Hiroshi Sakamoto 《Journal of Discrete Algorithms》2005,3(2-4):416-430
A linear-time approximation algorithm for the grammar-based compression is presented. This is an optimization problem to minimize the size of a context-free grammar deriving a given string. For each string of length n, the algorithm guarantees approximation ratio without suffix tree construction. 相似文献
183.
本在Glover—Klingman算法及最小费用支撑树对策的基础上,讨论了最小费用k度限制树对策问题.利用威胁、旁支付理论制订了两种规则,并利用优超、策略等价理论分别给出了在这两种规则下最小费用k度限制树对策核心中的解,从而证明了在这两种规则下其核心非空. 相似文献
184.
基于代数变换和KMM算法的框架,通过在牛顿方程中嵌入一种自调节功能,提出了一种新的求解P0阵线性互补问题的不可行内点算法,并证明了该算法的全局收敛性. 相似文献
185.
186.
一种直线逼近渐开线齿廓曲线的自适应算法 总被引:1,自引:1,他引:0
从渐开线弧长公式出发,引入一种能根据加工精度要求来确定逼近线段的段数,并使节点在渐开线齿廓曲线上分布均匀的自适应计算方法。给出计算实例及用AutoCAD来绘制齿轮的方法.以及用VLisp语言编制计算程序和绘图程序的框图。 相似文献
187.
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS (PART I:EQUAL TIMES AND COSTS) 总被引:1,自引:0,他引:1
Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented. 相似文献
188.
This paper concerns methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a specified key or decrypt the broadcast message. Moreover, this is done in such a way that no coalition is able to recover any information on a key or broadcast message they are not supposed to know. The problems are studied using the tools of information theory, so the security provided is unconditional (i.e., not based on any computational assumption).In a recent paper st95a, Stinson described a method of constructing key predistribution schemes by combining Mitchell-Piper key distribution patterns with resilient functions; and also presented a construction method for broadcast encryption schemes that combines Fiat-Naor key predistribution schemes with ideal secret sharing schemes. In this paper, we further pursue these two themes, providing several nice applications of these techniques by using combinatorial structures such as orthogonal arrays, perpendicular arrays, Steiner systems and universal hash families. 相似文献
189.
Masakazu Muramatsu 《Mathematical Programming》1998,83(1-3):393-406
In this paper, we introduce an affine scaling algorithm for semidefinite programming (SDP), and give an example of a semidefinite
program such that the affine scaling algorithm converges to a non-optimal point. Both our program and its dual have interior
feasible solutions and unique optimal solutions which satisfy strict complementarity, and they are non-degenerate everywhere. 相似文献
190.
用初等的方法研究了m/n表法,并给出了真分数表成单位分数和的一类特解。 相似文献