全文获取类型
收费全文 | 6870篇 |
免费 | 194篇 |
国内免费 | 55篇 |
专业分类
化学 | 4284篇 |
晶体学 | 50篇 |
力学 | 107篇 |
数学 | 1311篇 |
物理学 | 1367篇 |
出版年
2024年 | 8篇 |
2023年 | 31篇 |
2022年 | 143篇 |
2021年 | 180篇 |
2020年 | 129篇 |
2019年 | 191篇 |
2018年 | 205篇 |
2017年 | 173篇 |
2016年 | 253篇 |
2015年 | 216篇 |
2014年 | 216篇 |
2013年 | 481篇 |
2012年 | 430篇 |
2011年 | 534篇 |
2010年 | 373篇 |
2009年 | 307篇 |
2008年 | 439篇 |
2007年 | 405篇 |
2006年 | 367篇 |
2005年 | 354篇 |
2004年 | 304篇 |
2003年 | 245篇 |
2002年 | 199篇 |
2001年 | 88篇 |
2000年 | 86篇 |
1999年 | 99篇 |
1998年 | 77篇 |
1997年 | 55篇 |
1996年 | 86篇 |
1995年 | 49篇 |
1994年 | 46篇 |
1993年 | 51篇 |
1992年 | 41篇 |
1991年 | 29篇 |
1990年 | 14篇 |
1989年 | 17篇 |
1988年 | 10篇 |
1987年 | 10篇 |
1986年 | 12篇 |
1985年 | 15篇 |
1984年 | 13篇 |
1983年 | 18篇 |
1982年 | 14篇 |
1981年 | 13篇 |
1979年 | 8篇 |
1978年 | 11篇 |
1977年 | 12篇 |
1976年 | 6篇 |
1975年 | 11篇 |
1973年 | 5篇 |
排序方式: 共有7119条查询结果,搜索用时 15 毫秒
31.
Vladimir Ya Shevchenko 《Structural chemistry》2012,23(4):943-944
There is a special collection of contribution in the August 2012 issue of Structural Chemistry honoring the Swedish crystallographer Sten Andersson. This Encomium emphasizes the exemplary characteristics of his oeuvre. 相似文献
32.
Vladimir R. Rosenfeld Douglas J. Klein Josep M. Oliva 《Journal of mathematical chemistry》2012,50(7):2012-2022
Various sorts of isomer enumeration problems are addressed in the context of polycarboranes, with special illustrative focus on the case of dicarboranes, for which then various numerical results are given. A systematic and general Pólya-theoretic methodology is used to make the computations, including some new techniques being applicable to a wide range of nano-structures built from a framework of like local subunits. 相似文献
33.
Rafael O. Ruggiero Vladimir A. Rosas Meneses 《Bulletin of the Brazilian Mathematical Society》2003,34(2):263-274
In this paper, we show that the Pesin set of an expansive
geodesic flow in compact manifold with no conjugate points and
bounded asymptote coincides a.e with an open and dense set of
the unit tangent bundle. We also show that the set of hyperbolic
periodic orbits is dense in the unit tangent bundle. 相似文献
34.
Let An = K x1,...,xn be a free associative algebra over a fieldK. In this paper, examples are given of elements u An, n 3,such that the factor algebra of An over the ideal generatedby u is isomorphic to An1, and yet u is not a primitiveelement of An (that is, it cannot be taken to x1 by an automorphismof An). If the characteristic of the ground field K is 0, thisyields a negative answer to a question of G. Bergman. On theother hand, by a result of Drensky and Yu, there is no suchexample for n = 2. It should be noted that a similar questionfor polynomial algebras, known as the embedding conjecture ofAbhyankar and Sathaye, is a major open problem in affine algebraicgeometry. 2000 Mathematics Subject Classification 16S10, 16W20(primary); 14A05, 13B25 (secondary). 相似文献
35.
36.
Vladimir V. Vershinin 《Acta Appl Math》2003,75(1-3):281-292
Malcev–Poisson structure on a manifold is analogous to a Poisson structure with the Lie identity replaced by a slightly more general Malcev identity. Examples of such structures arise naturally. In the second part of the paper we study Malcev bialgebras. A theorem of characterization is proved. 相似文献
37.
We solve a bitangential interpolation problem for contractive multipliers
on the Arveson space with an arbitrary interpolating set in the closed
unit ball . The solvability criterion is established in terms of positive
kernels. The set of all solutions is parametrized by a Redheffer transform.
Submitted: February 2, 2002. 相似文献
38.
Endre Boros Khaled Elbassioni Vladimir Gurvich Leonid Khachiyan 《Mathematical Programming》2003,98(1-3):355-368
A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G is at most p+1, where is the number of pairs of vertices in G at distance 2, and p is the cardinality of a maximum induced matching in G. In this paper, we give an analogue of this result for hypergraphs and, more generally, for subsets of vectors in the product of n lattices =1××n, where the notion of an induced matching in G is replaced by a certain binary tree each internal node of which is mapped into . We show that our bounds may be nearly sharp for arbitrarily large hypergraphs and lattices. As an application, we prove that the number of maximal infeasible vectors x=1××n for a system of polymatroid inequalities does not exceed max{Q,logt/c(2Q,)}, where is the number of minimal feasible vectors for the system, , , and c(,) is the unique positive root of the equation 2c(c/log–1)=1. This bound is nearly sharp for the Boolean case ={0,1}n, and it allows for the efficient generation of all minimal feasible sets to a given system of polymatroid inequalities with quasi-polynomially bounded right-hand sides .
This research was supported by the National Science Foundation (Grant IIS-0118635), and by the Office of Naval Research (Grant N00014-92-J-1375). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.Mathematics Subject Classification (2000):20E28, 20G40, 20C20 相似文献
39.
Vladimir Bolotnikov 《Proceedings of the American Mathematical Society》2003,131(5):1373-1383
All solutions of a tangential interpolation problem for contractive multipliers between two reproducing kernel Hilbert spaces of analytic vector-valued functions are characterized in terms of certain positive kernels. In a special important case when the spaces consist of analytic functions on the unit ball of and the reproducing kernels are of the form and , the characterization leads to a parametrization of the set of all solutions in terms of a linear fractional transformation.
40.
Ostashev VE Collier SL Wilson DK Aldridge DF Symons NP Marlin D 《The Journal of the Acoustical Society of America》2007,122(1):107-112
Formulation and implementation of time-domain boundary conditions (TDBCs) at the surface of a reactive porous material are made challenging by the slow decay, complexity, or noncausal nature of many commonly used models of porous materials. In this paper, approaches are described that improve computational efficiency and enforce causality. One approach involves approximating the known TDBC for the modified Zwikker-Kosten impedance model as a summation of decaying exponential functions. A second approach, which can be applied to any impedance model, involves replacing the characteristic admittance with its Padé approximation. Then, approximating fractional derivatives with decaying exponentials, a causal and recursive TDBC is formulated. 相似文献