全文获取类型
收费全文 | 29582篇 |
免费 | 2442篇 |
国内免费 | 2076篇 |
专业分类
化学 | 1276篇 |
晶体学 | 18篇 |
力学 | 1357篇 |
综合类 | 449篇 |
数学 | 6254篇 |
物理学 | 3498篇 |
综合类 | 21248篇 |
出版年
2024年 | 161篇 |
2023年 | 350篇 |
2022年 | 650篇 |
2021年 | 715篇 |
2020年 | 620篇 |
2019年 | 626篇 |
2018年 | 652篇 |
2017年 | 856篇 |
2016年 | 951篇 |
2015年 | 965篇 |
2014年 | 1503篇 |
2013年 | 1505篇 |
2012年 | 1674篇 |
2011年 | 1812篇 |
2010年 | 1381篇 |
2009年 | 1709篇 |
2008年 | 1760篇 |
2007年 | 2314篇 |
2006年 | 2104篇 |
2005年 | 1727篇 |
2004年 | 1587篇 |
2003年 | 1349篇 |
2002年 | 1181篇 |
2001年 | 963篇 |
2000年 | 794篇 |
1999年 | 722篇 |
1998年 | 620篇 |
1997年 | 544篇 |
1996年 | 430篇 |
1995年 | 355篇 |
1994年 | 263篇 |
1993年 | 248篇 |
1992年 | 217篇 |
1991年 | 146篇 |
1990年 | 147篇 |
1989年 | 121篇 |
1988年 | 108篇 |
1987年 | 65篇 |
1986年 | 46篇 |
1985年 | 42篇 |
1984年 | 33篇 |
1983年 | 10篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 7篇 |
1979年 | 6篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 6篇 |
1955年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
无线搜索已成为一个新的研究、开发领域.并且它主要用到信息检索、人工智能、数据挖掘、自然语言处理、排序算法等多领域的理论和技术.此外,它拥有大量的用户,有很好的经济价值,所以引起了世界各国计算机科学界和信息产业界的高度关注,目前的研究、开发十分活跃,并出现了很多值得注意的动向. 相似文献
62.
63.
达草灭对莱茵衣藻(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基因突变的参与。 相似文献
64.
Gowravaram Sabitha G.S.Kiran Kumar ReddyK.Bhaskar Reddy J.S. Yadav 《Tetrahedron letters》2003,44(34):6497-6499
The three component condensation of an aldehyde, a β-keto ester and urea (thiourea) in the presence of a catalytic amount of VCl3 is disclosed for the solution phase synthesis of dihydropyrimidinones. The ease of synthesis and work-up allowed the parallel synthesis of a 48-membered library of dihydropyrimidinones quickly and efficiently in good yields. 相似文献
65.
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 相似文献
66.
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. 相似文献
67.
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 相似文献
68.
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]. 相似文献
69.
Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered... 相似文献
70.
Toshihiro Kobayashi 《Mathematical Methods in the Applied Sciences》2004,27(1):79-89
This paper is concerned with global stabilization of an undamped non‐linear string in the case where any velocity feedback is not available. The linearized system has an infinite number of poles and zeros on the imaginary axis. In the case where any velocity feedback is not available, a parallel compensator is effective. The stabilizer is constructed for the augmented system which consists of the controlled system and a parallel compensator. It is proved that the string can be stabilized by linear boundary control. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献