全文获取类型
收费全文 | 1713篇 |
免费 | 162篇 |
国内免费 | 153篇 |
专业分类
化学 | 67篇 |
晶体学 | 2篇 |
力学 | 219篇 |
综合类 | 38篇 |
数学 | 1359篇 |
物理学 | 343篇 |
出版年
2024年 | 3篇 |
2023年 | 20篇 |
2022年 | 17篇 |
2021年 | 23篇 |
2020年 | 22篇 |
2019年 | 30篇 |
2018年 | 34篇 |
2017年 | 40篇 |
2016年 | 28篇 |
2015年 | 27篇 |
2014年 | 48篇 |
2013年 | 104篇 |
2012年 | 60篇 |
2011年 | 83篇 |
2010年 | 68篇 |
2009年 | 87篇 |
2008年 | 99篇 |
2007年 | 121篇 |
2006年 | 119篇 |
2005年 | 117篇 |
2004年 | 83篇 |
2003年 | 112篇 |
2002年 | 110篇 |
2001年 | 92篇 |
2000年 | 88篇 |
1999年 | 88篇 |
1998年 | 78篇 |
1997年 | 67篇 |
1996年 | 38篇 |
1995年 | 35篇 |
1994年 | 16篇 |
1993年 | 8篇 |
1992年 | 5篇 |
1991年 | 13篇 |
1990年 | 8篇 |
1989年 | 6篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 5篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1957年 | 1篇 |
排序方式: 共有2028条查询结果,搜索用时 15 毫秒
1.
2.
《Indagationes Mathematicae》2022,33(1):218-237
We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic , and with coefficients in a field of odd characteristic ): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols. 相似文献
3.
The finiteness is proved of the set of isomorphism classes of potentially abelian geometric Galois representations with a given set of data. This is a special case of the finiteness conjecture of Fontaine and Mazur. 相似文献
4.
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.
5.
The turbulent flow in a compound meandering channel with a rectangular cross section is one of the most complicated turbulent flows, because the flow behaviour is influenced by several kinds of forces, including centrifugal forces, pressure‐driven forces and shear stresses generated by momentum transfer between the main channel and the flood plain. Numerical analysis has been performed for the fully developed turbulent flow in a compound meandering open‐channel flow using an algebraic Reynolds stress model. The boundary‐fitted coordinate system is introduced as a method for coordinate transformation in order to set the boundary conditions along the complicated shape of the meandering open channel. The turbulence model consists of transport equations for turbulent energy and dissipation, in conjunction with an algebraic stress model based on the Reynolds stress transport equations. With reference to the pressure–strain term, we have made use of a modified pressure–strain term. The boundary condition of the fluctuating vertical velocity is set to zero not only for the free surface, but also for computational grid points next to the free surface, because experimental results have shown that the fluctuating vertical velocity approaches zero near the free surface. In order to examine the validity of the present numerical method and the turbulent model, the calculated results are compared with experimental data measured by laser Doppler anemometer. In addition, the compound meandering open channel is clarified somewhat based on the calculated results. As a result of the analysis, the present algebraic Reynolds stress model is shown to be able to reasonably predict the turbulent flow in a compound meandering open channel. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
6.
I. Panin 《K-Theory》2003,30(3):265-314
This article contains proofs of the results announced by Panin and Smirnov (http://www. math.uiuc.edu/k-theory/0459/2000) in the part concerning general properties of oriented cohomology theories of algebraic varieties. It is constructed one-to-one correspondences between orientations, Chern structures and Thom structures on a given ring cohomology theory. The theory is illustrated by motivic cohomology, algebraic K-theory, algebraic cobordism theory and by other examples. 相似文献
7.
A theorem of Birkhoff‐Frink asserts that every algebraic closure operator on an ordinary set arises, from some algebraic structure on the set, as the corresponding generated subalgebra operator. However, for many‐sorted sets, i.e., indexed families of sets, such a theorem is not longer true without qualification. We characterize the corresponding many‐sorted closure operators as precisely the uniform algebraic operators. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
8.
Zhu Yongliang; Pagilla Prabhakar R. 《IMA Journal of Mathematical Control and Information》2005,22(2):181-186
We derive some useful and easily computable necessary conditionsfor the existence of a positive semi-definite solution to thealgebraic Ricatti equation (ARE). A motivating example is givento highlight the usefulness of the conditions for controllerand observer designs for nonlinear systems. Further, an upperbound on the trace of the solution to the ARE is also derived. 相似文献
9.
Jrg Winkelmann 《Mathematische Nachrichten》1997,186(1):285-302
We investigate under which conditions an algebraic group G defined over a locally compact field k admitr a subgroup Γ? G(k) which is dense in the Zariski topology, but discerte in the topology induced by the locally compact topology on k. For non—solvable groups we provide a complete answer. 相似文献
10.
A. A. Dokukin 《Computational Mathematics and Mathematical Physics》2006,46(5):914-918
To validate approximate optimization schemes for estimate calculation algorithms (ECAs), it is necessary to compute the optimal height, which cannot be done in a reasonable amount of time. A variety of samples are built for which the optimal height of the ECAs is known by construction. 相似文献