全文获取类型
收费全文 | 3131篇 |
免费 | 173篇 |
国内免费 | 118篇 |
专业分类
化学 | 91篇 |
晶体学 | 1篇 |
力学 | 9篇 |
综合类 | 29篇 |
数学 | 3114篇 |
物理学 | 178篇 |
出版年
2024年 | 12篇 |
2023年 | 57篇 |
2022年 | 86篇 |
2021年 | 66篇 |
2020年 | 115篇 |
2019年 | 112篇 |
2018年 | 99篇 |
2017年 | 95篇 |
2016年 | 65篇 |
2015年 | 64篇 |
2014年 | 113篇 |
2013年 | 316篇 |
2012年 | 86篇 |
2011年 | 174篇 |
2010年 | 169篇 |
2009年 | 286篇 |
2008年 | 238篇 |
2007年 | 186篇 |
2006年 | 179篇 |
2005年 | 102篇 |
2004年 | 107篇 |
2003年 | 106篇 |
2002年 | 82篇 |
2001年 | 67篇 |
2000年 | 65篇 |
1999年 | 68篇 |
1998年 | 68篇 |
1997年 | 54篇 |
1996年 | 33篇 |
1995年 | 11篇 |
1994年 | 19篇 |
1993年 | 19篇 |
1992年 | 12篇 |
1991年 | 9篇 |
1990年 | 12篇 |
1989年 | 13篇 |
1988年 | 9篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 11篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有3422条查询结果,搜索用时 31 毫秒
71.
Rupert B. Hurley 《Journal of separation science》1980,3(3):147-148
This paper describes a design for an all-glass GC/MS interface. The design has advantages due to low dead volume, lack of column effluent adsorption and degradation, simple interface production and installation, and ease of column mounting/dismounting. 相似文献
72.
Summary A general definition of reaction graphs is presented. For a pair of isomeric molecular graphs
and
, related by a chemical transformation
, the reaction graph
is determined using a maximal common subgraph defined for vertex mapping
. A binary operation defined for graphs constructed over the same vertex set enables us to decompose the reaction graph
into the sum of prototype reaction graphs. A decomposition of an overall reaction graph can be advantageously used for the construction of a reaction network. An oriented path in this network beginning at
and ending at
corresponds to a breakdown of the transformation
into a sequence of intermediates. 相似文献
73.
Pogliani L 《Journal of computational chemistry》2003,24(9):1097-1109
The complete graph conjecture that encodes the inner-core electrons of atoms with principal quantum number n >or= 2 with complete graphs, and especially with odd complete graphs, is discussed. This conjecture is used to derive new values for the molecular connectivity and pseudoconnectivity basis indices of hydrogen-suppressed chemical pseudographs. For atoms with n = 2 the new values derived with this conjecture are coincident with the old ones. The modeling ability of the new homogeneous basis indices, and of the higher-order terms, is tested and compared with previous modeling studies, which are centered on basis indices that are either based on quantum concepts or partially based on this new conjecture for the inner-core electrons. Two similar algorithms have been proposed with this conjecture, and they parallel the two "quantum" algorithms put forward by molecular connectivity for atoms with n > 2. Nine properties of five classes of compounds have been tested: the molecular polarizabilities of a class of organic compounds, the dipole moment, molar refraction, boiling points, ionization energies, and parachor of a series of halomethanes, the lattice enthalpy of metal halides, the rates of hydrogen abstraction of chlorofluorocarbons, and the pED(50) of phenylalkylamines. The two tested algorithms based on the odd complete graph conjecture give rise to a highly interesting model of the nine properties, and three of them can even be modeled by the same set of basis indices. Interesting is the role of some basis indices all along the model. 相似文献
74.
Bholanath Mandal 《International journal of quantum chemistry》2005,103(2):140-148
A graph theoretical procedure for obtaining eigenvalues of linear chains and cycles having alternant vertex weights (h1, h2, h1, h2, h1, h2, …) and the same edge weight (k) have been developed. The eigenvalues of some complicated graphs, such as graphs of linear polyacenes, methylene‐substituted linear polyacenes and cylindrical polyacene strips, stack graphs, and reciprocal graphs have been shown to be generated in closed analytical forms by this procedure. Many such graphs represent chemically important molecules or radicals. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2005 相似文献
75.
《Optimization》2012,61(5):743-754
In this paper the problem of estimation of an optimal replacement interval for a system which is minimally repaired at failures is studied. The problem is investigated both under a parametric and a nonparametric form of the failure intensity of the system. It is assumed that observational data from n systems are available. Some asymptotic results are shown. A graphical procedure for determining/estimating an optimal replacement interval is presented. The procedure is particularly valuable for sensitivity analyses, for example with respect to the costs involved. 相似文献
76.
77.
We present a generalization of a family of points on , the Diamond ensemble, containing collections of N points on with very small logarithmic energy for all . We extend this construction to the real projective plane and we obtain upper and lower bounds with explicit constants for the Green and logarithmic energy on this last space. 相似文献
78.
79.
《Discrete Mathematics》2023,346(4):113288
Square coloring is a variant of graph coloring where vertices within distance two must receive different colors. When considering planar graphs, the most famous conjecture (Wegner, 1977) states that colors are sufficient to square color every planar graph of maximum degree Δ. This conjecture has been proven asymptotically for graphs with large maximum degree. We consider here planar graphs with small maximum degree and show that colors are sufficient, which improves the best known bounds when . 相似文献
80.