全文获取类型
收费全文 | 3289篇 |
免费 | 350篇 |
国内免费 | 208篇 |
专业分类
化学 | 1150篇 |
晶体学 | 17篇 |
力学 | 210篇 |
综合类 | 70篇 |
数学 | 1330篇 |
物理学 | 1070篇 |
出版年
2024年 | 7篇 |
2023年 | 56篇 |
2022年 | 72篇 |
2021年 | 121篇 |
2020年 | 109篇 |
2019年 | 127篇 |
2018年 | 108篇 |
2017年 | 150篇 |
2016年 | 152篇 |
2015年 | 137篇 |
2014年 | 215篇 |
2013年 | 273篇 |
2012年 | 145篇 |
2011年 | 167篇 |
2010年 | 149篇 |
2009年 | 200篇 |
2008年 | 194篇 |
2007年 | 186篇 |
2006年 | 170篇 |
2005年 | 144篇 |
2004年 | 124篇 |
2003年 | 121篇 |
2002年 | 92篇 |
2001年 | 71篇 |
2000年 | 88篇 |
1999年 | 96篇 |
1998年 | 83篇 |
1997年 | 45篇 |
1996年 | 36篇 |
1995年 | 28篇 |
1994年 | 34篇 |
1993年 | 28篇 |
1992年 | 12篇 |
1991年 | 24篇 |
1990年 | 9篇 |
1989年 | 8篇 |
1988年 | 8篇 |
1987年 | 7篇 |
1986年 | 11篇 |
1985年 | 10篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 8篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1976年 | 1篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有3847条查询结果,搜索用时 15 毫秒
21.
E.D. Aydin C.R.E. de Oliveira 《Journal of Quantitative Spectroscopy & Radiative Transfer》2004,84(3):247-260
In this paper, we solve the steady-state form of the Boltzmann transport equation in homogeneous and heterogeneous tissue-like media with a finite element-spherical harmonics (FE-PN) radiation transport method. We compare FE-transport and diffusion solutions in terms of the ratio of absorption to reduced scattering coefficient, (μa/μs′) and the anisotropy factor g. Two different scattering phase function formulas are employed to model anisotropic scattering in the slab media with high g-value. Influence of void-like heterogeneities, and of their boundaries with the surrounding medium on the transport of photons are also examined. 相似文献
22.
This work presents a formulation based on UPML for truncating conductive media by using a local and non-orthogonal coordinate
system to solve Maxwell’s equations by the FDTD method. The detailed procedure for obtaining the UPML equations for this case
is shown and the complete equation set is provided. 相似文献
23.
Tetsushi Nishida Kokichi Sugihara Masato Kimura 《Journal of Computational and Applied Mathematics》2007
The Voronoi diagram in a flow field is a tessellation of water surface into regions according to the nearest island in the sense of a “boat-sail distance”, which is a mathematical model of the shortest time for a boat to move from one point to another against the flow of water. The computation of the diagram is not easy, because the equi-distance curves have singularities. To overcome the difficulty, this paper derives a new system of equations that describes the motion of a particle along the shortest path starting at a given point on the boundary of an island, and thus gives a new variant of the marker-particle method. In the proposed method, each particle can be traced independently, and hence the computation can be done stably even though the equi-distance curves have singular points. 相似文献
24.
Gaiane Panina 《Central European Journal of Mathematics》2006,4(2):270-293
Hyperbolic virtual polytopes arose originally as polytopal versions of counterexamples to the following A.D.Alexandrov’s uniqueness
conjecture: Let K ⊂ ℝ3
be a smooth convex body. If for a constant C, at every point of ∂K, we have R
1 ≤ C ≤ R
2
then K is a ball. (R
1
and R
2
stand for the principal curvature radii of ∂K.)
This paper gives a new (in comparison with the previous construction by Y.Martinez-Maure and by G.Panina) series of counterexamples
to the conjecture. In particular, a hyperbolic virtual polytope (and therefore, a hyperbolic hérisson) with odd an number
of horns is constructed.
Moreover, various properties of hyperbolic virtual polytopes and their fans are discussed. 相似文献
25.
26.
Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??1 and ??2, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??1 or ??2, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??1 or ??2. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, ti (0 ≤ i ≤ d) satisfy (s, t2, t3) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006 相似文献
27.
28.
J. Freudenberger 《Discrete Applied Mathematics》2006,154(2):294-304
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and the complexity of this suboptimum list decoding scheme for the binary symmetric channel. The reliability function of the list decoding scheme is equivalent to the sphere-packing bound, where the decoding complexity is asymptotically bounded by 2nR(1-R). Furthermore, we investigate a decision feedback strategy that is based on bounded distance list decoding. Here, any output with zero or many codewords will call for a repeated transmission. In this case the decoding complexity will be of the order 2nR(1-C), where C denotes the channel capacity. The reliability function is close to Forney's feedback exponent. 相似文献
29.
30.
We study the behavior of dynamic programming methods for the tree edit distance problem, such as [P. Klein, Computing the edit-distance between unrooted ordered trees, in: Proceedings of 6th European Symposium on Algorithms, 1998, p. 91–102; K. Zhang, D. Shasha, SIAM J. Comput. 18 (6) (1989) 1245–1262]. We show that those two algorithms may be described as decomposition strategies. We introduce the general framework of cover strategies, and we provide an exact characterization of the complexity of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies. 相似文献