全文获取类型
收费全文 | 177篇 |
免费 | 11篇 |
国内免费 | 14篇 |
专业分类
化学 | 44篇 |
力学 | 14篇 |
综合类 | 7篇 |
数学 | 58篇 |
物理学 | 79篇 |
出版年
2023年 | 1篇 |
2022年 | 7篇 |
2021年 | 5篇 |
2020年 | 12篇 |
2019年 | 3篇 |
2018年 | 2篇 |
2017年 | 6篇 |
2016年 | 7篇 |
2015年 | 5篇 |
2014年 | 3篇 |
2013年 | 10篇 |
2012年 | 11篇 |
2011年 | 15篇 |
2010年 | 8篇 |
2009年 | 15篇 |
2008年 | 7篇 |
2007年 | 14篇 |
2006年 | 5篇 |
2005年 | 9篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 5篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 7篇 |
1998年 | 3篇 |
1997年 | 7篇 |
1996年 | 1篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1986年 | 1篇 |
1982年 | 1篇 |
1980年 | 1篇 |
排序方式: 共有202条查询结果,搜索用时 15 毫秒
91.
Birte Schrader Sylvain Reboux Ivo F. Sbalzarini 《Journal of computational physics》2010,229(11):4159-4182
The general integral particle strength exchange (PSE) operators [J.D. Eldredge, A. Leonard, T. Colonius, J. Comput. Phys. 180 (2002) 686–709] approximate derivatives on scattered particle locations to any desired order of accuracy. Convergence is, however, limited to a certain range of resolutions. For high-resolution discretizations, the constant discretization error dominates and prevents further convergence. We discuss a consistent discretization correction framework for PSE operators that yields the desired rate of convergence for any resolution, both on uniform Cartesian and irregular particle distributions, as well as near boundaries. These discretization-corrected (DC) PSE operators also have no overlap condition, enabling the kernel width to become arbitrarily small for constant interparticle spacing. We show that, on uniform Cartesian particle distributions, this leads to a seamless transition between DC PSE operators and classical finite difference stencils. We further identify relationships between DC PSE operators and operators used in corrected smoothed particle hydrodynamics and reproducing kernel particle methods. We analyze the presented DC PSE operators with respect to accuracy, rate of convergence, computational efficiency, numerical dispersion, numerical diffusion, and stability. 相似文献
92.
We describe an approach for measuring 2D shape-of-object dissimilarity. The shape of the different objects to be compared is mapped to a representation invariant under translation, rotation, and area. Thus, the shapes will have the same amount of information to describe them (equal number of pixels). The measure of dissimilarity is based on the transformation of one shape into another. This transformation is performed by moving pixels. Thus, the shape difference could be ascertained by counting how many pixels we have to move and how far to change one shape into another. When the shape transformation is performed, the distribution of the shape difference is computed, which permits an improvement in shape comparison. 相似文献
93.
94.
95.
N. A. Kuz’mina 《Russian Mathematics (Iz VUZ)》2008,52(7):61-65
The paper is devoted to the study of intrinsic geometry of a Cartan distribution \(\mathcal{M}\) in projective space P2m . We essentially use the hyperband distribution \(\mathcal{H}\) and P2m associated with \(\mathcal{M}\). Using the duality theory, we construct, in the 4th differential neighborhood, a series of normalizations of \(\mathcal{M}\). We also consider dual affine connections \(\mathop \nabla \limits^1 \) and \(\mathop \nabla \limits^2 \) induced by the dual normalization of the Cartan distribution \(\mathcal{M}\). 相似文献
96.
97.
A. G. D’yakonov 《Computational Mathematics and Mathematical Physics》2007,47(6):1050-1060
An algebra over recognition algorithms supplemented with a normalization operation (under various definitions) and the division operation is investigated. Correctness criteria for various algebraic closures are obtained. 相似文献
98.
99.
100.
Sambin [6] proved the normalization theorem (Hauptsatz) for GL, the modal logic of provability, in a sequent calculus version called by him GLS. His proof does not take into account the concept of reduction, commonly used in normalization proofs. Bellini [1], on the other hand, gave a normalization proof for GL using reductions. Indeed, Sambin's proof is a decision procedure which builds cut-free proofs. In this work we formalize this procedure as a recursive function and prove its recursiveness in an arithmetically formalizable way, concluding that the normalization of GL can be formalized in PA. MSC: 03F05, 03B35, 03B45. 相似文献