全文获取类型
收费全文 | 491579篇 |
免费 | 4937篇 |
国内免费 | 2079篇 |
专业分类
化学 | 242476篇 |
晶体学 | 7624篇 |
力学 | 24112篇 |
综合类 | 61篇 |
数学 | 69259篇 |
物理学 | 155063篇 |
出版年
2020年 | 3276篇 |
2019年 | 3606篇 |
2018年 | 11897篇 |
2017年 | 12579篇 |
2016年 | 10238篇 |
2015年 | 5140篇 |
2014年 | 6974篇 |
2013年 | 17624篇 |
2012年 | 17348篇 |
2011年 | 27139篇 |
2010年 | 17844篇 |
2009年 | 17769篇 |
2008年 | 24339篇 |
2007年 | 27274篇 |
2006年 | 15220篇 |
2005年 | 18929篇 |
2004年 | 15124篇 |
2003年 | 13810篇 |
2002年 | 12070篇 |
2001年 | 12405篇 |
2000年 | 9627篇 |
1999年 | 7144篇 |
1998年 | 6068篇 |
1997年 | 5938篇 |
1996年 | 5929篇 |
1995年 | 5242篇 |
1994年 | 5248篇 |
1993年 | 5191篇 |
1992年 | 5520篇 |
1991年 | 5692篇 |
1990年 | 5336篇 |
1989年 | 5213篇 |
1988年 | 5195篇 |
1987年 | 5047篇 |
1986年 | 4880篇 |
1985年 | 6573篇 |
1984年 | 6790篇 |
1983年 | 5655篇 |
1982年 | 5962篇 |
1981年 | 5753篇 |
1980年 | 5382篇 |
1979年 | 5730篇 |
1978年 | 5989篇 |
1977年 | 5869篇 |
1976年 | 5961篇 |
1975年 | 5445篇 |
1974年 | 5602篇 |
1973年 | 5705篇 |
1972年 | 4197篇 |
1971年 | 3415篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
951.
952.
Tracing is a method of assigning flows in an electricity network to particular generators and loads, assuming perfect mixing at each node. It can be used to assign costs to transmission users. We show that the resulting allocation is equal to the Shapley value of an equivalent co-operative game. 相似文献
953.
954.
Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented. 相似文献
955.
D. P. Zhelobenko 《Acta Appl Math》2004,81(1):347-354
A special class of associative algebras is introduced and studied. A criteria of semisimplicity for suitable category of modules is obtained. 相似文献
956.
D. P. Zhelobenko 《Acta Appl Math》2004,81(1):355-383
An algebraic approach to harmonic analysis on reductive Lie groups is proposed. The case of complex semisimple Lie groups is considered in details. Some problems for real reductive Lie groups are discussed. 相似文献
957.
Using the result by D. Gessler, we show that any invariant variational bivector (resp., variational 2-form) on an evolution equation with nondegenerate right-hand side is Hamiltonian (resp., symplectic). 相似文献
958.
In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the
Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead
and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph.
This revised version was published online in September 2006 with corrections to the Cover Date. 相似文献
959.
C. -H. L. Ong 《Annals of Pure and Applied Logic》2004,130(1-3):125-171
We prove that the observational equivalence of third-order finitary (i.e. recursion-free) Idealized Algol (IA) is decidable using Game Semantics. By modelling the state explicitly in our games, we show that the denotation of a term M of this fragment of IA is a compactly innocent strategy-with-state, i.e. the strategy is generated by a finite view function fM. Given any such fM, we construct a real-time deterministic pushdown automaton (DPDA) that recognizes the complete plays of the knowing-strategy denotation of M. Since such plays characterize observational equivalence, and there is an algorithm for deciding whether any two DPDAs recognize the same language, we obtain a procedure for deciding the observational equivalence of third-order finitary IA. Restricted to second-order terms, the DPDA representation cuts down to a deterministic finite automaton; thus our approach gives a new proof of Ghica and McCusker’s regular-expression characterization for this fragment. Our algorithmic representation of program meanings, which is compositional, provides a foundation for model-checking a wide range of behavioural properties of IA and other cognate programming languages. Another result concerns second-order IA with full recursion: we show that observational equivalence for this fragment is undecidable. 相似文献
960.
In this work, the effect of flexibility on the trajectory of a planar two-link manipulator is studied using integrated computer-aided design/analysis (CAD/CAE) procedures. The solid models and finite element models of the parts of the manipulator are created by using the CAD/CAE software I-DEAS. The assembly is defined, and knowing the payload and the end point trajectory, the velocities and accelerations of the parts, joint forces and driving torques are calculated using the rigid body dynamics. All the time dependent nodal forces acting on the parts including distributed gravity and inertia forces are created in files with the I-DEAS program file format. The finite element vibration analysis of the parts is performed by I-DEAS. The end point vibrations and the deviations from the rigid-body trajectory are analyzed for different types of end point acceleration curves. A circular trajectory is considered as an example. It is observed that the precision of the manipulator can be increased by testing different end point acceleration curves without changing the trajectory and the duration of the end point work. The procedure explained in this work can be used for this purpose successfully. 相似文献