全文获取类型
收费全文 | 2193篇 |
免费 | 241篇 |
国内免费 | 216篇 |
专业分类
化学 | 501篇 |
晶体学 | 3篇 |
力学 | 208篇 |
综合类 | 46篇 |
数学 | 1352篇 |
物理学 | 540篇 |
出版年
2024年 | 6篇 |
2023年 | 14篇 |
2022年 | 77篇 |
2021年 | 106篇 |
2020年 | 103篇 |
2019年 | 73篇 |
2018年 | 63篇 |
2017年 | 78篇 |
2016年 | 55篇 |
2015年 | 71篇 |
2014年 | 108篇 |
2013年 | 149篇 |
2012年 | 103篇 |
2011年 | 134篇 |
2010年 | 95篇 |
2009年 | 164篇 |
2008年 | 135篇 |
2007年 | 131篇 |
2006年 | 126篇 |
2005年 | 108篇 |
2004年 | 104篇 |
2003年 | 98篇 |
2002年 | 70篇 |
2001年 | 54篇 |
2000年 | 59篇 |
1999年 | 57篇 |
1998年 | 68篇 |
1997年 | 57篇 |
1996年 | 42篇 |
1995年 | 28篇 |
1994年 | 27篇 |
1993年 | 13篇 |
1992年 | 16篇 |
1991年 | 11篇 |
1990年 | 10篇 |
1989年 | 5篇 |
1988年 | 6篇 |
1987年 | 4篇 |
1986年 | 2篇 |
1985年 | 3篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 3篇 |
1979年 | 2篇 |
1977年 | 1篇 |
1974年 | 1篇 |
1973年 | 2篇 |
1957年 | 1篇 |
排序方式: 共有2650条查询结果,搜索用时 843 毫秒
61.
Marién Abreu Jan Goedgebeur Domenico Labbate Giuseppe Mazzuoccolo 《Journal of Graph Theory》2019,92(4):415-444
A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests. 相似文献
62.
Kreweras conjectured that every perfect matching of a hypercube for can be extended to a hamiltonian cycle of . Fink confirmed the conjecture to be true. It is more general to ask whether every perfect matching of for can be extended to two or more hamiltonian cycles of . In this paper, we prove that every perfect matching of for can be extended to at least different hamiltonian cycles of . 相似文献
63.
Olga V. Dorofeeva 《Journal of computational chemistry》2020,41(27):2352-2364
The DLPNO-CCSD(T1)/CBS method combined with simple reactions containing small reference species leads to an improvement in the accuracy of theoretically evaluated enthalpies of formation of medium-sized polyalicyclic hydrocarbons when compared with the widely used composite approach. The efficiency of the DLPNO-CCSD(T1)/CBS method is most vividly demonstrated by comparing with the results of G4 calculations for adamantane. The most important factor in choosing appropriate working reaction is the same number of species on both sides of the equation. Among these reactions, the reactions with small enthalpy change usually provide a better cancellation of errors. The DLPNO-CCSD(T1)/CBS method was used to calculate the enthalpies of formation of compounds belonging to the norbornadiene cycle (norbornadiene, quadricyclane, norbornene, nortricyclane, and norbornane). The most reliable experimental enthalpies of formation are recommended for these compounds by comparing calculated values with conflicting experimental data. 相似文献
64.
65.
Insoluble sludge is generated in the reprocessing of spent fuel. The sludge obtained from the dissolution of irradiated fuel from the “Joyo” experimental fast reactor was analyzed to evaluate its chemical form. The sludge was collected by the filtration of the dissolved fuel solution, and then washed in nitric acid. The yields of the sludge weight were less than 1% of the total fuel weight. The chemical composition of the sludge was analyzed after decomposition by alkaline fusion. Molybdenum, technetium, ruthenium, rhodium, and palladium were found to be the main constituent elements of the sludge. X-ray diffraction patterns of the sludge were attributable to Mo4Ru4RhPd, regardless of the experimental conditions. The concentrations of molybdenum and zirconium in the dissolved fast reactor fuel solutions were low, indicating that zirconium molybdate hydrate is produced in negligible amounts in the process. 相似文献
66.
《Discrete Mathematics》2022,345(2):112676
The complete 3-uniform hypergraph of order v has a vertex set V of size v and the set of all 3-element subsets of V as its edge set. A tight 6-cycle is a hypergraph with vertex set and edge set . We show that there exists a decomposition of the complete 3-uniform hypergraph of order v into isomorphic copies of a tight 6-cycle if and only if , 2, 10, 20, 28, or . 相似文献
67.
We discuss the length of the longest directed cycle in the sparse random digraph , constant. We show that for large there exists a function such that a.s. The function where is a polynomial in . We are only able to explicitly give the values , although we could in principle compute any . 相似文献
68.
In this paper, we give a polytopal estimate of Mirkovi?–Vilonen polytopes lying in a Demazure crystal in terms of Minkowski sums of extremal Mirkovi?–Vilonen polytopes. As an immediate consequence of this result, we provide a necessary (but not sufficient) polytopal condition for a Mirkovi?–Vilonen polytope to lie in a Demazure crystal. 相似文献
69.
Let G be a graph with vertex set V(G) and edge set E(G). A labeling f : V(G) →Z2 induces an edge labeling f*: E(G) → Z2 defined by f*(xy) = f(x) + f(y), for each edge xy ∈ E(G). For i ∈ Z2, let vf(i) = |{v ∈ V(G) : f(v) = i}| and ef(i) = |{e ∈ E(G) : f*(e) =i}|. A labeling f of a graph G is said to be friendly if |vf(0)- vf(1)| ≤ 1. The friendly index set of the graph G, denoted FI(G), is defined as {|ef(0)- ef(1)|: the vertex labeling f is friendly}. This is a generalization of graph cordiality. We investigate the friendly index sets of cyclic silicates CS(n, m). 相似文献
70.
在经济活动中,投资行为和资本存量存在一定的时滞效应,这会影响经济周期模型的动态行为,进而使得投资政策对经济的稳定调整复杂化.考虑到资本存量的预期时间以及投资时滞对经济活动的影响,采用Hopf分岔理论,研究具有固定时滞的经济周期模型的均衡点的稳定性以及形成经济周期的条件.研究发现,投资过程中的投资时滞,以及投资决策中对于资本存量的预测时间构成经济周期产生的诱因;同时可通过政府投资政策调整达到预期均衡目标,这对保持经济周期稳定及经济政策制定有一定的指导作用. 相似文献