全文获取类型
收费全文 | 187篇 |
免费 | 34篇 |
国内免费 | 5篇 |
专业分类
化学 | 68篇 |
晶体学 | 2篇 |
综合类 | 2篇 |
数学 | 85篇 |
物理学 | 69篇 |
出版年
2024年 | 1篇 |
2023年 | 5篇 |
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 10篇 |
2019年 | 8篇 |
2018年 | 6篇 |
2017年 | 13篇 |
2016年 | 6篇 |
2015年 | 4篇 |
2014年 | 10篇 |
2013年 | 21篇 |
2012年 | 14篇 |
2011年 | 5篇 |
2010年 | 10篇 |
2009年 | 13篇 |
2008年 | 8篇 |
2007年 | 10篇 |
2006年 | 11篇 |
2005年 | 7篇 |
2004年 | 11篇 |
2003年 | 2篇 |
2002年 | 4篇 |
2001年 | 7篇 |
2000年 | 3篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1985年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有226条查询结果,搜索用时 28 毫秒
31.
Mirka Miller Joe Ryan Zdeněk Ryjáček Jakub Teska Petr Vrána 《Journal of Graph Theory》2013,74(1):67-80
If is a subclass of the class of claw‐free graphs, then is said to be stable if, for any , the local completion of G at any vertex is also in . If is a closure operation that turns a claw‐free graph into a line graph by a series of local completions and is stable, then for any . In this article, we study stability of hereditary classes of claw‐free graphs defined in terms of a family of connected closed forbidden subgraphs. We characterize line graph preimages of graphs in families that yield stable classes, we identify minimal families that yield stable classes in the finite case, and we also give a general background for techniques for handling unstable classes by proving that their closure may be included into another (possibly stable) class. 相似文献
32.
Maurício Collares Yoshiharu Kohayakawa Robert Morris Guilherme O. Mota 《Random Structures and Algorithms》2020,56(4):1016-1030
We count orientations of avoiding certain classes of oriented graphs. In particular, we study , the number of orientations of the binomial random graph in which every copy of is transitive, and , the number of orientations of containing no strongly connected copy of . We give the correct order of growth of and up to polylogarithmic factors; for orientations with no cyclic triangle, this significantly improves a result of Allen, Kohayakawa, Mota, and Parente. We also discuss the problem for a single forbidden oriented graph, and state a number of open problems and conjectures. 相似文献
33.
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time. 相似文献
34.
应用计算机控制的PID控温仪研究了锑化铟样品的变温霍耳效应。通过在线控制并记录77K~300K温度范围内锑化铟样品的霍耳电压,估测了样品的禁带宽度。 相似文献
35.
Let be a family of n compact connected sets in the plane, whose intersection graph has no complete bipartite subgraph with k vertices in each of its classes. Then has at most n times a polylogarithmic number of edges, where the exponent of the logarithmic factor depends on k. In the case where consists of convex sets, we improve this bound to O(n log n). If in addition k = 2, the bound can be further improved to O(n). © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 205–214, 2008 相似文献
36.
Rundan Xing 《Linear and Multilinear Algebra》2016,64(9):1887-1898
37.
I. V. Bodnar V. F. Gremenok O. N. Obraztsova L. V. Rusak V. Yu. Rud' Yu. V. Rud' 《Journal of Applied Spectroscopy》1999,66(1):151-153
Based on single crystals of AgGaSe2, AgGaTe2, CuGaTe2 of the p-type, surface-barrier structures were manufactured by vacuum thermal deposition on illumination of which the photovoltaic
effect was observed. It is established that the longwave edge of the photosensitivity of such structures possesses several
inflections attributable to photoactive absorption involving paracipation of levels of lattice defects. It is shown that In/p-(Cu,
Ag)Ga(Se, Te)2 surface-barrier structures can be used as wide-band transducers and photoanalyzers of linearily polarized radiation.
Translated from Zhurrnal Prikladnoi Spektroskopii, Vol. 66, No. 1, pp. 141–144, January–February, 1999. 相似文献
38.
V. K. Jain 《Crystal Research and Technology》2004,39(9):784-787
Electron paramagnetic resonance of Gd3+ in Eu2Zn3(NO3)12·24H2O single crystals is studied at ≈9.45 GHz and at 298 and 77 K. Gd3+ substitutes for the Eu3+ site. In addition to the allowed fine structure lines, forbidden transitions (ΔM = ±2,±3,±4,±5) are observed. The superposition model is applied to the zero‐field splitting parameter b20. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
39.
We devise three sorts of doped left-handed materials (DLHMs) by introducing inductors and capacitors into the traditional left-handed material (LHM) as heterogeneous elements. Some new properties are presented through finitedifference time-domain (FDTD) simulations. On the one hand, the resonance in the traditional LHM is weakened and the original pass band is narrowed by introducing inductors. On the other hand, the original pass band of the LHM can be shifted and a new pass band can be generated by introducing capacitors. When capacitors and inductors are introduced simultaneously, the resonance of traditional LHM is somewhat weakened and the number of original pass bands as well as its bandwidth can be changed. 相似文献
40.
利用在线净化-快速溶剂萃取结合气相色谱-质谱联用技术,建立了一种快速、高效的多种致癌芳香胺类成分的样品前处理及分析方法。纺织样品中的偶氮染料在萃取池内高温和高压条件下进行氧化-还原裂解反应,裂解芳香胺产物萃取后,经池内硅藻土填料实现在线净化。10种芳香胺类物质在0.5~90 mg/L的范围内与峰面积呈线性,检测限在1.2~4.6 mg/kg之间,快速溶剂萃取处理所得10种致癌芳香胺成分的回收率在82.6%~96.3%之间,RSD范围在1.8%~4.7%之间。 相似文献