全文获取类型
收费全文 | 3249篇 |
免费 | 407篇 |
国内免费 | 265篇 |
专业分类
化学 | 665篇 |
晶体学 | 14篇 |
力学 | 271篇 |
综合类 | 81篇 |
数学 | 2046篇 |
物理学 | 844篇 |
出版年
2024年 | 3篇 |
2023年 | 23篇 |
2022年 | 74篇 |
2021年 | 74篇 |
2020年 | 82篇 |
2019年 | 80篇 |
2018年 | 87篇 |
2017年 | 108篇 |
2016年 | 122篇 |
2015年 | 76篇 |
2014年 | 149篇 |
2013年 | 274篇 |
2012年 | 142篇 |
2011年 | 157篇 |
2010年 | 161篇 |
2009年 | 189篇 |
2008年 | 224篇 |
2007年 | 186篇 |
2006年 | 197篇 |
2005年 | 195篇 |
2004年 | 126篇 |
2003年 | 132篇 |
2002年 | 117篇 |
2001年 | 113篇 |
2000年 | 128篇 |
1999年 | 99篇 |
1998年 | 96篇 |
1997年 | 86篇 |
1996年 | 59篇 |
1995年 | 58篇 |
1994年 | 38篇 |
1993年 | 19篇 |
1992年 | 27篇 |
1991年 | 23篇 |
1990年 | 13篇 |
1989年 | 14篇 |
1988年 | 20篇 |
1987年 | 17篇 |
1986年 | 8篇 |
1985年 | 17篇 |
1984年 | 23篇 |
1983年 | 9篇 |
1982年 | 13篇 |
1981年 | 17篇 |
1980年 | 8篇 |
1979年 | 11篇 |
1978年 | 5篇 |
1977年 | 8篇 |
1976年 | 3篇 |
1957年 | 3篇 |
排序方式: 共有3921条查询结果,搜索用时 328 毫秒
51.
Tjalling J. Ypma 《Numerical Linear Algebra with Applications》1995,2(6):533-541
An algorithm for pre- or post-multiplication of a matrix by a plane rotation, using only three vector saxpy operations instead of the four vector operations usually considered necessary, is described. No auxiliary storage for overwriting is required. The method is shown to be numerically stable. 相似文献
52.
应用一种新颖的无损伤测量技术-连续波电光检测法(CWEOP)对GaAs/GaAlAs单异质结发光管列阵电场分布进行了扫描测量。实验结果反映了器件内电流注入的方向和载流子扩展情况;通过比较各单元电场分布,反映器件发光均匀性。文中详细介绍了测量原理、实验装置和实验结果及讨论,最后用计算机对电场分布作了模拟计算并与实验结果进行了对照。 相似文献
53.
A. A. Tolstonogov 《Set-Valued Analysis》1998,6(2):129-147
Existence theorems of continuous selectors whose values are fixed points of multivalued contractions are proved. As an application, the existence of continuous selectors to generalized solution sets of partial differential inclusions, depending on a parameter, is obtained. 相似文献
54.
M. Markl 《Czechoslovak Mathematical Journal》2007,57(1):473-503
The aim of this note, which raises more questions than it answers, is to study natural operations acting on the cohomology
of various types of algebras. It contains a lot of very surprising partial results and examples. 相似文献
55.
Victor Snaith 《K-Theory》1991,5(3):265-279
Let G be a finite group. The class group of the group ring of G is a quotient of the idèlic homomorphisms of R(G) by the global functions and the determinantal functions. Using Explicit Brauer Induction, we prove Adams operations, applied to determinantal functions, satisfy some congruences which were conjectured by M. J. Taylor. As an application, we construct some new maps defined on the class group.In memory of J. Frank Adams (1930–1989)Research partially supported by NSERC Grant # 0GP0042580. 相似文献
56.
In this paper, we propose the treatment of complex reservoir operation problems via our newly developed tool of fuzzy criterion
decision processes. This novel approach has been shown to be a more flexible and useful analysis tool especially when it is
desirable to incorporate an expert’s knowledge into the decision models. Additionally, it has been demonstrated that this
form of decision models will usually result in an optimal solution, which guarantees the highest satisfactory degree. We provide
a practical exemplification procedure for the models presented as well as an application example. 相似文献
57.
P. Kh. Atanasova T. L. Bojadjiev S. N. Dimova 《Computational Mathematics and Mathematical Physics》2006,46(4):666-679
Partial critical dependences of the form current-magnetic field in a two-layered symmetric Josephson junction are modeled. A numerical experiment shows that, for the zero interaction coefficient between the layers of the junction, jumps of the critical currents corresponding to different distributions of the magnetic fluxes in the layers may appear on the critical curves. This fact allows a mathematical interpretation of the results of some recent experimental results for two-layered junctions as a consequence of discontinuities of partial critical curves. 相似文献
58.
A. A. Bulatov 《Algebra and Logic》2006,45(6):371-388
A combinatorial constraint satisfaction problem aims at expressing in unified terms a wide spectrum of problems in various
branches of mathematics, computer science, and AI. The generalized satisfiability problem is NP-complete, but many of its
restricted versions can be solved in a polynomial time. It is known that the computational complexity of a restricted constraint
satisfaction problem depends only on a set of polymorphisms of relations which are admitted to be used in the problem. For
the case where a set of such relations is invariant under some Mal’tsev operation, we show that the corresponding constraint
satisfaction problem can be solved in a polynomial time.
__________
Translated from Algebra i Logika, Vol. 45, No. 6, pp. 655–686, November–December, 2006. 相似文献
59.
This paper describes a numerical realization of an extended continuous Newton method defined by Diener. It traces a connected set of locally one-dimensional trajectories which contains all critical points of a smooth functionf:
n
. The results show that the method is effectively applicable.The authors would like to thank L. C. W. Dixon for pointing out some errors in the original version of this paper and for several suggestions of improvements. 相似文献
60.
An error in the expression for the Fe2+, Fe3+ valence-mixing probability in RBaFe2O5+w is acknowledged and correct formula is derived. The new formula slightly improves the least-squares fit to the experimental concentrations of the Mössbauer component Fe2.5+ as a function of the oxygen-nonstoichiometry parameter w for R=Eu. 相似文献