全文获取类型
收费全文 | 14345篇 |
免费 | 503篇 |
国内免费 | 4篇 |
专业分类
化学 | 7952篇 |
晶体学 | 42篇 |
力学 | 269篇 |
数学 | 1922篇 |
物理学 | 4667篇 |
出版年
2023年 | 114篇 |
2021年 | 126篇 |
2020年 | 174篇 |
2019年 | 108篇 |
2018年 | 153篇 |
2017年 | 155篇 |
2016年 | 357篇 |
2015年 | 344篇 |
2014年 | 322篇 |
2013年 | 631篇 |
2012年 | 609篇 |
2011年 | 793篇 |
2010年 | 325篇 |
2009年 | 292篇 |
2008年 | 692篇 |
2007年 | 673篇 |
2006年 | 655篇 |
2005年 | 536篇 |
2004年 | 417篇 |
2003年 | 410篇 |
2002年 | 366篇 |
2001年 | 345篇 |
2000年 | 275篇 |
1999年 | 226篇 |
1998年 | 189篇 |
1997年 | 198篇 |
1996年 | 207篇 |
1995年 | 192篇 |
1994年 | 171篇 |
1993年 | 197篇 |
1992年 | 196篇 |
1991年 | 158篇 |
1990年 | 132篇 |
1989年 | 128篇 |
1988年 | 117篇 |
1987年 | 129篇 |
1986年 | 137篇 |
1985年 | 151篇 |
1984年 | 184篇 |
1983年 | 159篇 |
1982年 | 171篇 |
1981年 | 183篇 |
1980年 | 161篇 |
1979年 | 150篇 |
1978年 | 167篇 |
1977年 | 158篇 |
1976年 | 137篇 |
1975年 | 128篇 |
1974年 | 121篇 |
1973年 | 110篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
This paper presents a basic endochronic plasticity model with isotropic hardening for small strain theory according to Valanis. The key point of this model is a convolution integral over an intrinsic time scale involving past values of the strain measure and a so-called memory kernel which leads to a smooth evolution equation for the internal variable. For the temporal discretization of the underlying constitutive equations and the resulting evolution equation we use higher order accurate variational integrators (VI). The remarkable feature is the fact that we approximate the position vector in terms of velocities according to partitioned Runge-Kutta methods (pRK). As a representative model problem serves a quasistatic, uniaxial tensile testing as well as a dynamic, elastoplastic cantilever beam with a smooth plasticity model according to the Valanis framework. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
992.
In a recent paper in the Journal of the Operational Research Society, Tone proposes an alternative to the Farrell cost efficiency index to avoid the ‘strange case’ problem in which firms with identical inputs and outputs but with input prices differing by some factor (eg, one has input prices twice another) will have the same Farrell cost efficiency. We provide an alternative cost efficiency indicator that avoids this problem, allows for decomposition into technical and allocative efficiency, and is easily estimated using DEA type models. 相似文献
993.
994.
D. Brandt W. Hälg J. Mennig 《Zeitschrift für Angewandte Mathematik und Physik (ZAMP)》1979,30(4):705-708
Summary A stable numerical approximation (H
-S
) is obtained through the use of Hermite's method of order (H
) in the spatial integration of the 1D neutron transport equation. The theory for =1 is applied to a one-group shielding problem.Numerical calculations show the new method to converge much faster than earlier versions ofS
-theory. Comparison ofH
1-S
with the well-knownS
N
-code ANISN indicates a large gain in computing time for the former.
Zusammenfassung Durch Anwendung der Hermiteschen Integrationsmethode der Ordnung (H ) auf die Ortsintegration der 1D Neutronentransportgleichung entsteht eine numerisch stabile Approximation (H -S ). Diese Methode wurde für =1 auf ein 1 Gruppen-Abschirmungsproblem angewandt.Numerische Rechnungen zeigen die wesentlich raschere Konvergenz der Methode verglichen mit den ursprünglichen Versionen derS -Theorie. Durch Vergleich mit dem bekanntenS N -Code ANISN wurde gezeigt, dass mit derH 1-S -Methode ein grosser Rechenzeitgewinn erzielt wird.相似文献
995.
Hannu Väliaho 《BIT Numerical Mathematics》1979,19(2):256-269
A procedure is proposed for the parametric linear programming problem where all the coefficients are linear or polynomial functions of a scalar parameter. The solution vector and the optimum value are determined explicitly as rational functions of the parameter. In addition to standard linear programming technique, only the determination of eigenvalues is required. The procedure is compared to those by Dinkelbach and Zsigmond, and a numerical example is given. 相似文献
996.
997.
A graph G is diameter k-critical if the graph has diameter k and the deletion of any edge increases its diameter. We show that every diameter 2-critical graph on v vertices has (i) at most 0.27v2 edges, and (ii) average edge degree at most v. We also make a conjecture on the maximal number of edges in a diameter k-critical graph. 相似文献
998.
Material parameter identification is the necessary link between constitutive modeling and application of material models in complex simulations of real world problems. We present an approach to make use of already developed stress algorithms for three-dimensional finite-element computations in terms of a reduction to uniaxial tensile tests for material parameter identification. Strain-driven stress algorithms lead to the approach of solving differential-algebraic equations. (© 2012 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
999.
We introduce a new approach to solve shape optimization problems with state constraints. The problem is reformulated on a fixed reference domain using conformal pull-back. The shape dependence is then hidden in the conformal parameter. The problem is discretized using FEM and solved as an NLP. Finally the optimal shape can be reconstructed from the optimal conformal parameter. (© 2012 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
1000.
Commutative multiplicatively idempotent semirings were studied by the authors and F. ?vr?ek, where the connections to distributive lattices and unitary Boolean rings were established. The variety of these semirings has nice algebraic properties and hence there arose the question to describe this variety, possibly by its subdirectly irreducible members. For the subvariety of so-called Boolean semirings, the subdirectly irreducible members were described by F. Guzmán. He showed that there were just two subdirectly irreducible members, which are the 2-element distributive lattice and the 2-element Boolean ring. We are going to show that although commutative multiplicatively idempotent semirings are at first glance a slight modification of Boolean semirings, for each cardinal n > 1, there exist at least two subdirectly irreducible members of cardinality n and at least 2n such members if n is infinite. For \({n \in \{2, 3, 4\}}\) the number of subdirectly irreducible members of cardinality n is exactly 2. 相似文献