全文获取类型
收费全文 | 2789篇 |
免费 | 169篇 |
国内免费 | 84篇 |
专业分类
化学 | 110篇 |
晶体学 | 1篇 |
力学 | 7篇 |
综合类 | 31篇 |
数学 | 2712篇 |
物理学 | 181篇 |
出版年
2024年 | 11篇 |
2023年 | 56篇 |
2022年 | 68篇 |
2021年 | 51篇 |
2020年 | 108篇 |
2019年 | 101篇 |
2018年 | 95篇 |
2017年 | 95篇 |
2016年 | 71篇 |
2015年 | 51篇 |
2014年 | 101篇 |
2013年 | 242篇 |
2012年 | 82篇 |
2011年 | 156篇 |
2010年 | 142篇 |
2009年 | 268篇 |
2008年 | 214篇 |
2007年 | 168篇 |
2006年 | 167篇 |
2005年 | 99篇 |
2004年 | 89篇 |
2003年 | 91篇 |
2002年 | 72篇 |
2001年 | 62篇 |
2000年 | 64篇 |
1999年 | 55篇 |
1998年 | 55篇 |
1997年 | 43篇 |
1996年 | 28篇 |
1995年 | 10篇 |
1994年 | 14篇 |
1993年 | 14篇 |
1992年 | 10篇 |
1991年 | 9篇 |
1990年 | 12篇 |
1989年 | 12篇 |
1988年 | 10篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 12篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 3篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有3042条查询结果,搜索用时 390 毫秒
61.
F. B. Shepherd 《Mathematical Programming》1994,64(1-3):295-323
A 0, 1 matrixA isnear-perfect if the integer hull of the polyhedron {x0: Ax
} can be obtained by adding one extra (rank) constraint. We show that in general, such matrices arise as the cliquenode incidence matrices of graphs. We give a colouring-like characterization of the corresponding class of near-perfect graphs which shows that one need only check integrality of a certain linear program for each 0, 1, 2-valued objective function. This in contrast with perfect matrices where it is sufficient to check 0, 1-valued objective functions. We also make the following conjecture: a graph is near-perfect if and only if sequentially lifting any rank inequality associated with a minimally imperfect graph results in the rank inequality for the whole graph. We show that the conjecture is implied by the Strong Perfect Graph Conjecture. (It is also shown to hold for graphs with no stable set of size eleven.) Our results are used to strengthen (and give a new proof of) a theorem of Padberg. This results in a new characterization of minimally imperfect graphs: a graph is minimally imperfect if and only if both the graph and its complement are near-perfect.The research has partially been done when the author visited Mathematic Centrum, CWI, Amsterdam, The Netherlands. 相似文献
62.
It is known that one-dimensional lattice problems with a discrete, finite set of states per site generically have periodic ground states (GSs). We consider slightly less generic cases, in which the Hamiltonian is constrained by either spin (S) or spatial (I) inversion symmetry (or both). We show that such constraints give rise to the possibility ofdisordered GSs over a finite fraction of the coupling-parameter space—that is, without invoking any nongeneric fine tuning of coupling constants, beyond that arising from symmetry. We find that such disordered GSs can arise for many values of the number of statesk at each site and the ranger of the interaction. The Ising (k=2) case is the least prone to disorder:I symmetry allows for disordered GSs (without fine tuning) only forr5, whileS symmetry never gives rise to disordered GSs. 相似文献
63.
We study the Hopfield model of an autoassociative memory on a random graph onN vertices where the probability of two vertices being joined by a link isp(N). Assuming thatp(N) goes to zero more slowly thanO(1/N), we prove the following results: (1) If the number of stored patternsm(N) is small enough such thatm(N)/Np(N) 0, asN, then the free energy of this model converges, upon proper rescaling, to that of the standard Curie-Weiss model, for almost all choices of the random graph and the random patterns. (2) If in additionm(N) < ln N/ln 2, we prove that there exists, forT< 1, a Gibbs measure associated to each original pattern, whereas for higher temperatures the Gibbs measure is unique. The basic technical result in the proofs is a uniform bound on the difference between the Hamiltonian on a random graph and its mean value. 相似文献
64.
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. 相似文献
65.
66.
Lianghui Gao Mengjie Gong Fanbo Kong Ting Yuan Xiaohong Li Lili Zu Yunchao Li Louzhen Fan 《大学化学》2020,35(5):81-87
During the fight against the new coronavirus epidemic, the "Physical Chemistry" team of Beijing Normal University used various network platforms and tools, such as MOOC of China University, Rain Classroom and WeChat Group in the teaching process. The exploration and practice of online learning of "Physical Chemistry" is carried out based on MOOC teaching, with student learning as the center and teacher guidance as the support. Taking the most difficult chapter of "fundamentals for statistical thermodynamic" as an example, we designed a complex teaching program that includes previews, watching MOOC videos in class, real-time online exercises, teachers' answers, and after-class reflection and questioning. The students were encouraged to learn independently through the reserved information, designed activities and assignments. Practice shows that the online course has cultivated the students' self-management ability, trained their critical thinking skills, and achieved good teaching results. 相似文献
67.
A deterministic algorithm for enumeration of transmembrane protein folds is presented. Using a set of sparse pairwise atomic distance constraints (such as those obtained from chemical cross-linking, FRET, or dipolar EPR experiments), the algorithm performs an exhaustive search of secondary structure element packing conformations distributed throughout the entire conformational space. The end result is a set of distinct protein conformations, which can be scored and refined as part of a process designed for computational elucidation of transmembrane protein structures. 相似文献
68.
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. 相似文献
69.
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 相似文献
70.