全文获取类型
收费全文 | 9250篇 |
免费 | 1168篇 |
国内免费 | 362篇 |
专业分类
化学 | 988篇 |
晶体学 | 14篇 |
力学 | 1042篇 |
综合类 | 389篇 |
数学 | 5658篇 |
物理学 | 2689篇 |
出版年
2024年 | 15篇 |
2023年 | 87篇 |
2022年 | 224篇 |
2021年 | 283篇 |
2020年 | 204篇 |
2019年 | 202篇 |
2018年 | 229篇 |
2017年 | 338篇 |
2016年 | 457篇 |
2015年 | 302篇 |
2014年 | 556篇 |
2013年 | 621篇 |
2012年 | 507篇 |
2011年 | 557篇 |
2010年 | 451篇 |
2009年 | 581篇 |
2008年 | 604篇 |
2007年 | 625篇 |
2006年 | 502篇 |
2005年 | 461篇 |
2004年 | 405篇 |
2003年 | 343篇 |
2002年 | 319篇 |
2001年 | 276篇 |
2000年 | 245篇 |
1999年 | 213篇 |
1998年 | 200篇 |
1997年 | 165篇 |
1996年 | 144篇 |
1995年 | 108篇 |
1994年 | 72篇 |
1993年 | 83篇 |
1992年 | 73篇 |
1991年 | 40篇 |
1990年 | 48篇 |
1989年 | 28篇 |
1988年 | 34篇 |
1987年 | 23篇 |
1986年 | 29篇 |
1985年 | 31篇 |
1984年 | 28篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 6篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
31.
32.
33.
资源有限的加权总完工时间单机排序问题 总被引:1,自引:0,他引:1
本讨论资源有限的加权总工时间单机排序问题,对现在仍为OPEN问题1|pj=bj-ajuj,∑uj≤U|∑wjCj给出了一个有关最优解中最优资源分配的重要性质,并利用该性质分别给出了三种情况bj=b,wj=w,aj=a;bj=b,wj=w,uj=u;aj=a,wj=w,uj=u的最优算法。 相似文献
34.
35.
36.
达草灭对莱茵衣藻(Chlamydomonas reinhardtii) 品系遗传后效应的研究 总被引:1,自引:0,他引:1
通过将莱菌衣藻(Chlamydomonas reinhardtii)6种达草灭抗性突变株分别与野生型株、丧失合成叶绿素b能力的cbnI-43等基因突变株和精氨酸依赖型突变株杂交对其后代进行四分析与随机分析,发现在Nfr-4-Nfr-7突变株中达草灭抗性状只有单一核基因遗传的性质,而在Nfr-1、Nfr-3~Nfr-7抗性株的抗性性状都是由同一个nfr-1基因(norflurazon resisanse)的突变所决定的,而Nfr-4抗性株的抗性性状是由另一滚突变等位基因nfr-2所决定的。在Nfr-1和Nfr-3抗性株中除了nfr-1基因的突变还有nfr-3基因突变的参与。 相似文献
37.
We present a practical polynomial-time algorithm for computing the
zeta function of a Kummer curve over a finite field of small
characteristic. Such algorithms have recently been obtained using a
method of Kedlaya based upon Monsky–Washnitzer cohomology, and are of
interest in cryptography. We take a different approach.
The problem is reduced to that of computing the L-function
of a multiplicative character sum. This latter task is achieved via a
cohomological formula based upon the work of Dwork and Reich. We show,
however, that our method and that of Kedlaya are very closely related.Dedicated to the memory of Gian-Carlo Rota 相似文献
38.
A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
39.
In this paper we focus on the problem of identifying the index sets P(x):=i|xi>0, N(x):={i|Fi(x)>0 and C(x):=i|xi=Fi(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10 相似文献
40.
Clemens Heuberger 《Periodica Mathematica Hungarica》2004,49(2):65-89
We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6]. 相似文献