全文获取类型
收费全文 | 19385篇 |
免费 | 2676篇 |
国内免费 | 544篇 |
专业分类
化学 | 759篇 |
晶体学 | 14篇 |
力学 | 1032篇 |
综合类 | 324篇 |
数学 | 5490篇 |
物理学 | 2814篇 |
无线电 | 12172篇 |
出版年
2024年 | 73篇 |
2023年 | 254篇 |
2022年 | 445篇 |
2021年 | 527篇 |
2020年 | 521篇 |
2019年 | 447篇 |
2018年 | 460篇 |
2017年 | 658篇 |
2016年 | 872篇 |
2015年 | 889篇 |
2014年 | 1424篇 |
2013年 | 1335篇 |
2012年 | 1367篇 |
2011年 | 1492篇 |
2010年 | 1038篇 |
2009年 | 1180篇 |
2008年 | 1308篇 |
2007年 | 1361篇 |
2006年 | 1143篇 |
2005年 | 947篇 |
2004年 | 799篇 |
2003年 | 699篇 |
2002年 | 602篇 |
2001年 | 465篇 |
2000年 | 420篇 |
1999年 | 310篇 |
1998年 | 295篇 |
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条查询结果,搜索用时 16 毫秒
201.
We address the problem of computing homotopic shortest paths in the presence of obstacles in the plane. Problems on homotopy of paths received attention very recently [Cabello et al., in: Proc. 18th Annu. ACM Sympos. Comput. Geom., 2002, pp. 160–169; Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. We present two output-sensitive algorithms, for simple paths and non-simple paths. The algorithm for simple paths improves the previous algorithm [Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. The algorithm for non-simple paths achieves O(log2n) time per output vertex which is an improvement by a factor of O(n/log2n) of the previous algorithm [Hershberger, Snoeyink, Comput. Geom. Theory Appl. 4 (1994) 63–98], where n is the number of obstacles. The running time has an overhead O(n2+) for any positive constant . In the case k<n2+, where k is the total size of the input and output, we improve the running to O((n+k+(nk)2/3)logO(1)n). 相似文献
202.
This paper proposes a two step algorithm for solving a large scale semi-definite logit model, which is appreciated as a powerful
model in failure discriminant analysis. This problem has been successfully solved by a cutting plane (outer approximation)
algorithm. However, it requires much more computation time than the corresponding linear logit model. A two step algorithm
to be proposed in this paper is intended to reduce the amount of computation time by eliminating a certain portion of the
data based on the information obtained by solving an associated linear logit model. It will be shown that this algorithm can
generate a solution with almost the same quality as the solution obtained by solving the original large scale semi-definite
model within a fraction of computation time. 相似文献
203.
204.
Michael Szydlo 《Journal of Number Theory》2004,104(1):75-99
Kodaira and Néron classified and described the geometry of the special fibers of the Néron model of an elliptic curve defined over a discrete valuation ring with a perfect residue field. Tate described an algorithm to determine the special fiber type by manipulating the Weierstrass equation. In the case of non-perfect residue fields, we discover new fiber types which are not on the Kodaira-Néron list. We describe these new types and extend Tate's algorithm to deal with all discrete valuation rings. Specifically, we show how to translate a Weierstrass equation into a form where the reduction type may be easily determined. Having determined the special fiber type, we construct the regular model of the curve with explicit blow-up calculations. We also provide tables that serve as a simple reference for the algorithm and which succinctly summarize the results. 相似文献
205.
线性规划的符号跟踪算法 总被引:2,自引:1,他引:1
分析了只含一个约束条件的线性规划最优基变量的特征,将其运用到搜寻含m个约束条件的线性规划的最优基变量,从而提出了线性规划的符号跟踪算法,为线性规划求解提供了新途径。 相似文献
206.
The presented work offers new algorithms for phase evaluation in interferometric measurements. Several phase-shifting algorithms with an arbitrary but constant phase-shift between captured intensity frames are proposed. These phase calculation algorithms need to measure five frames of the intensity of the interference field. The algorithms are similarly derived as so called Carré algorithm. The phase evaluation process then does not depend on the linear phase shift errors. Furthermore, the detailed analysis of the algorithms with respect to most important factors, which affect interferometric measurements, is carried out. It is also studied the dependency of the evaluation algorithms on the phase shift values, and the proposed phase calculation algorithms are compared with respect to the resulting phase errors. The influence of most important factors in the measurement and evaluation process was simulated as systematic and random errors using a proposed mathematical model. 相似文献
207.
208.
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. 相似文献
209.
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. 相似文献
210.
本在Glover—Klingman算法及最小费用支撑树对策的基础上,讨论了最小费用k度限制树对策问题.利用威胁、旁支付理论制订了两种规则,并利用优超、策略等价理论分别给出了在这两种规则下最小费用k度限制树对策核心中的解,从而证明了在这两种规则下其核心非空. 相似文献