全文获取类型
收费全文 | 1408篇 |
免费 | 66篇 |
国内免费 | 75篇 |
专业分类
化学 | 156篇 |
力学 | 45篇 |
综合类 | 2篇 |
数学 | 1133篇 |
物理学 | 213篇 |
出版年
2024年 | 4篇 |
2023年 | 29篇 |
2022年 | 23篇 |
2021年 | 31篇 |
2020年 | 35篇 |
2019年 | 50篇 |
2018年 | 37篇 |
2017年 | 19篇 |
2016年 | 24篇 |
2015年 | 28篇 |
2014年 | 64篇 |
2013年 | 167篇 |
2012年 | 61篇 |
2011年 | 91篇 |
2010年 | 82篇 |
2009年 | 116篇 |
2008年 | 91篇 |
2007年 | 96篇 |
2006年 | 57篇 |
2005年 | 57篇 |
2004年 | 55篇 |
2003年 | 42篇 |
2002年 | 42篇 |
2001年 | 29篇 |
2000年 | 28篇 |
1999年 | 29篇 |
1998年 | 40篇 |
1997年 | 24篇 |
1996年 | 24篇 |
1995年 | 19篇 |
1994年 | 7篇 |
1993年 | 5篇 |
1992年 | 5篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1985年 | 6篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有1549条查询结果,搜索用时 10 毫秒
1.
A generalization of strong regularity around a vertex subset C of a graph Γ, which makes sense even if Γis non-regular, is studied. Such a structure appears, together with a kind of distance-regularity around C , when an spectral bound concerning the so-called predistance polynomial of C is attained. As a main consequence of these results, it is shown that a regular (connected) graph Γwith d + 1 distinct eigenvalues is distance-regular, and its distance- d graph Γ d is strongly regular with parameters a = c , if and only if the number of vertices at distance d from each vertex satisfies an expression which depends only on the order of Γand the different eigenvalues of Γ. 相似文献
2.
3.
Bruce R. McGarvey 《Coordination chemistry reviews》1998,170(1):75-92
Using a newly proposed approach involving an internally consistent set of equations, the ligand field parameters Δ/ξ, V/ξ and k are obtained from literature values of the g matrix for strong field d5 systems of various conformations in which |Δ/ξ|≤10. Qualitative analysis of the observed results is done using the Angular Overlap Model, AOM. 相似文献
4.
The authors introduce a notion of a weak graph map homotopy (they call it
M-homotopy), discuss its properties and applications. They prove that the weak graph
map homotopy equivalence between graphs coincides with the graph homotopy equivalence
defined by Yau et al in 2001. The difference between them is that the weak graph map
homotopy transformation is defined in terms of maps, while the graph homotopy transformation is defined by means of combinatorial operations. They discuss its advantages over
the graph homotopy transformation. As its applications, they investigate the mapping
class group of a graph and the 1-order MP-homotopy group of a pointed simple graph.
Moreover, they show that the 1-order MP-homotopy group of a pointed simple graph is
invariant up to the weak graph map homotopy equivalence. 相似文献
5.
6.
7.
M. Gurioli M. Zamfirescu F. Stokker-Cheregi A. Vinattieri I.R. Sellers F. Semond M. Leroux J. Massies 《Superlattices and Microstructures》2007,41(5-6):284
We present a detailed experimental study aimed at demonstrating the polariton nature of the photoluminescence emission in a bulk GaN microcavity grown on (111) silicon. The comparison of the photoluminescence with coincident reflectivity measurements at different temperatures shows an anticrossing behaviour with a Rabi splitting of the order of 35 meV up to room temperature. Relevant confirmations of the mixing between excitons and photons are found in the analysis of the spectral linewidth and of the time resolved kinetics. 相似文献
8.
Daniel K. Benvenuti 《Discrete Mathematics》2010,310(21):2841-2846
A graph G on n vertices is said to be separable cost constant Hamiltonian (SC-Hamiltonian) if and only if G is Hamiltonian and for any cost matrix C=(c(i,j)) associated with G where all tours have the same cost, there exist vectors a=(a1,…,an) and b=(b1,…,bn) such that . In this paper we show that for symmetric digraphs strong Hamiltonicity is a necessary condition for SC-Hamiltonicity. As a surprising consequence, we prove that the symmetric digraph obtained from an undirected SC-Hamiltonian graph by edge duplication need not be SC-Hamiltonian. This settles a conjecture of Kabadi and Punnen. We then show that an undirected graph on an even number of nodes having an edge that appears in every Hamiltonian cycle cannot be SC-Hamiltonian. Using this we establish that multiple subdivision of an edge need not preserve SC-Hamiltonicity, disproving a previous claim. Further, we identify other necessary conditions for SC-Hamiltonicity and obtain new classes of SC-Hamiltonian graphs. 相似文献
9.
Velan SS 《Journal of magnetic resonance (San Diego, Calif. : 1997)》2004,171(2):40-352
Longitudinal multispin orders provide an effective way for measurement of scalar couplings and also to probe molecular interactions and dynamics. Analysis of longitudinal orders has been made in strongly coupled AB and ABX spin systems to determine the dependence of strong coupling parameter on these orders. Experimental and simulated spectra of various longitudinal orders are illustrated for these spin systems. This general procedure can be extended to broad range of spin systems to understand the influence of strong coupling on longitudinal orders. 相似文献
10.
Ching-Yu Yang Yu-Lin Chang Jein-Shan Chen 《Nonlinear Analysis: Theory, Methods & Applications》2011,74(16):5766-5783
Given a Hilbert space H, the infinite-dimensional Lorentz/second-order cone K is introduced. For any x∈H, a spectral decomposition is introduced, and for any function f:R→R, we define a corresponding vector-valued function fH(x) on Hilbert space H by applying f to the spectral values of the spectral decomposition of x∈H with respect to K. We show that this vector-valued function inherits from f the properties of continuity, Lipschitz continuity, differentiability, smoothness, as well as s-semismoothness. These results can be helpful for designing and analyzing solution methods for solving infinite-dimensional second-order cone programs and complementarity problems. 相似文献