全文获取类型
收费全文 | 1395篇 |
免费 | 291篇 |
国内免费 | 89篇 |
专业分类
化学 | 121篇 |
晶体学 | 19篇 |
力学 | 185篇 |
综合类 | 44篇 |
数学 | 599篇 |
物理学 | 807篇 |
出版年
2023年 | 21篇 |
2022年 | 59篇 |
2021年 | 41篇 |
2020年 | 49篇 |
2019年 | 47篇 |
2018年 | 57篇 |
2017年 | 72篇 |
2016年 | 56篇 |
2015年 | 37篇 |
2014年 | 77篇 |
2013年 | 121篇 |
2012年 | 77篇 |
2011年 | 99篇 |
2010年 | 84篇 |
2009年 | 102篇 |
2008年 | 105篇 |
2007年 | 90篇 |
2006年 | 79篇 |
2005年 | 74篇 |
2004年 | 71篇 |
2003年 | 56篇 |
2002年 | 56篇 |
2001年 | 47篇 |
2000年 | 30篇 |
1999年 | 33篇 |
1998年 | 24篇 |
1997年 | 20篇 |
1996年 | 14篇 |
1995年 | 18篇 |
1994年 | 7篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 10篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1988年 | 2篇 |
1987年 | 4篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有1775条查询结果,搜索用时 15 毫秒
151.
The existence of a 2‐factor in K1, n‐free graphs with large connectivity and large edge‐connectivity
R. E. L. Aldred Yoshimi Egawa Jun Fujisawa Katsuhiro Ota Akira Saito 《Journal of Graph Theory》2011,68(1):77-89
In this article, we study the existence of a 2‐factor in a K1, n‐free graph. Sumner [J London Math Soc 13 (1976), 351–359] proved that for n?4, an (n?1)‐connected K1, n‐free graph of even order has a 1‐factor. On the other hand, for every pair of integers m and n with m?n?4, there exist infinitely many (n?2)‐connected K1, n‐free graphs of even order and minimum degree at least m which have no 1‐factor. This implies that the connectivity condition of Sumner's result is sharp, and we cannot guarantee the existence of a 1‐factor by imposing a large minimum degree. On the other hand, Ota and Tokuda [J Graph Theory 22 (1996), 59–64] proved that for n?3, every K1, n‐free graph of minimum degree at least 2n?2 has a 2‐factor, regardless of its connectivity. They also gave examples showing that their minimum degree condition is sharp. But all of them have bridges. These suggest that the effects of connectivity, edge‐connectivity and minimum degree to the existence of a 2‐factor in a K1, n‐free graph are more complicated than those to the existence of a 1‐factor. In this article, we clarify these effects by giving sharp minimum degree conditions for a K1, n‐free graph with a given connectivity or edge‐connectivity to have a 2‐factor. Copyright © 2010 Wiley Periodicals, Inc. J Graph Theory 68:77‐89, 2011 相似文献
152.
For each surface Σ, we define Δ(Σ) = max{Δ(G)|Gis a class two graph of maximum degree Δ(G) that can be embedded in Σ}. Hence, Vizing's Planar Graph Conjecture can be restated as Δ(Σ) = 5 if Σ is a plane. In this paper, we show that Δ(Σ) = 9 if Σ is a surface of characteristic χ(Σ) = ?5. © 2010 Wiley Periodicals, Inc. J Graph Theory 68:148‐168, 2011 相似文献
153.
An edge‐coloring of a graph G is equitable if, for each v∈V(G), the number of edges colored with any one color incident with v differs from the number of edges colored with any other color incident with v by at most one. A new sufficient condition for equitable edge‐colorings of simple graphs is obtained. This result covers the previous results, which are due to Hilton and de Werra, verifies a conjecture made by Hilton recently, and substantially extends it to a more general class of graphs. © 2010 Wiley Periodicals, Inc. J Graph Theory 66:175‐197, 2011 相似文献
154.
基于方向信息测度的图像边缘检测 总被引:1,自引:0,他引:1
边缘检测是图像处理中—个重要的研究课题.针对传统图像边缘检测算法对噪声敏感的问题,本文在分析图像像素灰度信息的基础上,建立了—个改进的确定方向信息测度的方法,并利用震动滤波对边缘检测图像进行增强,该方法在滤除噪声的同时,能有效地保留图像的基本目标信息,正确提取图像的边缘. 相似文献
155.
带二次修正项的Dirac方程在拓扑绝缘体、石墨烯、超导等新材料电磁光特性分析中有着十分广泛的应用.本文工作的创新点有:一是首次提出了矩阵形式带有二次修正项的Dirac方程,它是比较一般的数学框架,涵盖了上述材料体系很多重要的物理模型,具体见附录A;二是针对上述材料体系的电磁响应问题,提出了有界区域Weyl规范下具有周期间断系数矩阵形式带二次修正项Maxwell-Dirac系统的多尺度渐近方法,结合Crank-Nicolson有限差分方法和自适应棱单元方法,发展了一类多尺度算法.数值试验结果验证了多尺度渐近方法的正确性和算法的有效性. 相似文献
156.
Boniface Nkemzi Michael Jung 《Numerical Methods for Partial Differential Equations》2021,37(1):836-853
Solutions of boundary value problems in three‐dimensional domains with edges may exhibit singularities which are known to influence both the accuracy of the finite element solutions and the rate of convergence in the error estimates. This paper considers boundary value problems for the Poisson equation on typical domains Ω ? ?3 with edge singularities and presents, on the one hand, explicit computational formulas for the flux intensity functions. On the other hand, it proposes and analyzes a nonconforming finite element method on regular meshes for the efficient treatment of the singularities. The novelty of the present method is the use of the explicit formulas for the flux intensity functions in defining a postprocessing procedure in the finite element approximation of the solution. A priori error estimates in H1(Ω) show that the present algorithm exhibits the same rate of convergence as it is known for problems with regular solutions. 相似文献
157.
Hongxin Wang Anthony T. Young Jinghua Guo Stephen P. Cramer Stephan Friedrich Artur Braun Weiwei Gu 《Journal of synchrotron radiation》2013,20(4):614-619
X‐ray absorption and scattering spectroscopies involving the 3d transition‐metal K‐ and L‐edges have a long history in studying inorganic and bioinorganic molecules. However, there have been very few studies using the M‐edges, which are below 100 eV. Synchrotron‐based X‐ray sources can have higher energy resolution at M‐edges. M‐edge X‐ray absorption spectroscopy (XAS) and resonant inelastic X‐ray scattering (RIXS) could therefore provide complementary information to K‐ and L‐edge spectroscopies. In this study, M2,3‐edge XAS on several Co, Ni and Cu complexes are measured and their spectral information, such as chemical shifts and covalency effects, are analyzed and discussed. In addition, M2,3‐edge RIXS on NiO, NiF2 and two other covalent complexes have been performed and different d–d transition patterns have been observed. Although still preliminary, this work on 3d metal complexes demonstrates the potential to use M‐edge XAS and RIXS on more complicated 3d metal complexes in the future. The potential for using high‐sensitivity and high‐resolution superconducting tunnel junction X‐ray detectors below 100 eV is also illustrated and discussed. 相似文献
158.
In this paper we study the maximum two-flow problem in vertex- and edge-capacitated undirected ST2-planar graphs, that is, planar graphs where the vertices of each terminal pair are on the same face. For such graphs we provide an O(n) algorithm for finding a minimum two-cut and an O(n log n) algorithm for determining a maximum two-flow and show that the value of a maximum two-flow equals the value of a minimum two-cut. We further show that the flow obtained is half-integral and provide a characterization of edge and vertex capacitated ST2-planar graphs that guarantees a maximum two-flow that is integral. By a simple variation of our maximum two-flow algorithm we then develop, for ST2-planar graphs with vertex and edge capacities, an O(n log n) algorithm for determining an integral maximum two-flow of value not less than the value of a maximum two-flow minus one. 相似文献
159.
本文简述了用电视摄象机进行工业尺寸测量的微分法与拟合法的基本原理,同时详细的讨论了各自所能达到的精度极限。本文用实验验证了理论计算的结果,最后对二维工件测量时,如何根据工件的不同形状与位置以及光学系统的特点,提出了在测量时工件的放置应该注意的问题以及对工件拐角处如何进行处理的方法。 相似文献
160.
María Leonor S. Varas 《Advances in Computational Mathematics》1996,5(1):31-49
We present a method for signal reconstruction based upon the location of its singularities which are identified by a wavelet transform technique. The reconstructed signal is an infconvolution spline approximant. The data for the interpolation problem which we solve comes from a compact signal coding procedure. Error bounds and convergence results for the calculated signal are given. 相似文献