全文获取类型
收费全文 | 1265篇 |
免费 | 172篇 |
国内免费 | 173篇 |
专业分类
化学 | 339篇 |
晶体学 | 14篇 |
力学 | 59篇 |
综合类 | 17篇 |
数学 | 460篇 |
物理学 | 389篇 |
无线电 | 332篇 |
出版年
2024年 | 1篇 |
2023年 | 13篇 |
2022年 | 17篇 |
2021年 | 24篇 |
2020年 | 34篇 |
2019年 | 43篇 |
2018年 | 32篇 |
2017年 | 40篇 |
2016年 | 35篇 |
2015年 | 35篇 |
2014年 | 54篇 |
2013年 | 76篇 |
2012年 | 67篇 |
2011年 | 80篇 |
2010年 | 54篇 |
2009年 | 82篇 |
2008年 | 99篇 |
2007年 | 101篇 |
2006年 | 93篇 |
2005年 | 81篇 |
2004年 | 74篇 |
2003年 | 66篇 |
2002年 | 67篇 |
2001年 | 46篇 |
2000年 | 44篇 |
1999年 | 47篇 |
1998年 | 37篇 |
1997年 | 30篇 |
1996年 | 30篇 |
1995年 | 22篇 |
1994年 | 11篇 |
1993年 | 15篇 |
1992年 | 10篇 |
1991年 | 9篇 |
1990年 | 2篇 |
1989年 | 7篇 |
1988年 | 9篇 |
1987年 | 5篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有1610条查询结果,搜索用时 15 毫秒
1.
Organic conductor is a kind of organic compound which has special electronic and magnetic properties. The research of the organic compounds has received considerable attention because of their potential applications in many areas. The molecular conductive units are theoretically investigated as well as their energy gap and charge distribution. The relationship of conductivity and micro-mechanism is discussed. 相似文献
2.
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002 相似文献
3.
Annegret K. Wagler 《Mathematical Methods of Operations Research》2002,56(1):127-149
An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two
superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how
far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph
of a bipartite graph or from the complement of such a graph. 相似文献
4.
Proton conductivity of phosphoric acid derivative of fullerene 总被引:1,自引:0,他引:1
The proton conductive property of methano [60] fullerene diphosphoric acid has been investigated under various humidity conditions at the temperature range between 15 and 45 °C. It shows proton conductivity as high as 10−2 S cm−1 at 25 °C under relative humidity of 95%. Thermal analyses including TG–DTA and thermal desorption mass spectroscopy (TDS) confirm that the compound is thermally stable up to 200 °C. Proton conduction of the compound depends very much on humidity or water content. The logarithmic conductivity at 25 °C is increased linearly with increasing relative humidity. The activation energy (Ea) estimated from the slope of log(σT) vs. 1/T is decreased from 1.08 to 0.52 eV, as the relative humidity is increased from 40% to 75%. The humidity dependence of conductivity is discussed in the light of the observed hydration isotherm. 相似文献
5.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献
6.
How to select a generator of Zp* is an important problem in cryptographic applications, where p is an odd prime. In this paper, we mainly consider the especial case that p is a safe prime, and give an algorithm for selecting a generator of Zp*,and find all generators of Zp* , where p is a safe prime. Our algorithm is more faster than the algorithm in [1]. Based on the proposed algorithm, one could find all generators of Zp* as well, where p is a perfect prime. 相似文献
7.
Krzysztof Pawaowski 《K-Theory》1998,13(1):41-55
The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery. 相似文献
8.
10.
在水热晶化合成一系列NASICON型化合物的基础上,应用固体高分辨31P和29Si MAS NMR,研究了几种NASICON化合物的结构,观察其骨架原子P和Si在结构中的状态及分布,并解释了由于在结构中发生取代作用而引起,Si或P的化学位移的变化. 相似文献