全文获取类型
收费全文 | 130篇 |
免费 | 11篇 |
专业分类
化学 | 26篇 |
晶体学 | 1篇 |
力学 | 1篇 |
数学 | 69篇 |
物理学 | 44篇 |
出版年
2024年 | 2篇 |
2023年 | 1篇 |
2021年 | 3篇 |
2020年 | 5篇 |
2019年 | 2篇 |
2018年 | 3篇 |
2017年 | 8篇 |
2016年 | 9篇 |
2015年 | 5篇 |
2014年 | 8篇 |
2013年 | 7篇 |
2012年 | 6篇 |
2011年 | 8篇 |
2010年 | 4篇 |
2009年 | 8篇 |
2008年 | 5篇 |
2007年 | 5篇 |
2006年 | 7篇 |
2005年 | 3篇 |
2004年 | 2篇 |
2003年 | 1篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 3篇 |
1999年 | 1篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1986年 | 1篇 |
1984年 | 3篇 |
1982年 | 2篇 |
1981年 | 5篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有141条查询结果,搜索用时 15 毫秒
31.
32.
Salant A Amitay-Sadovsky E Banin U 《Journal of the American Chemical Society》2006,128(31):10006-10007
Gold-tipped CdSe rods (nanodumbbells) were solubilized in an aqueous phase and self-assembled in a head-to-tail manner using biotin disulfide and avidin. The disulfide end of the biotin molecule attaches to the gold tip of the nanodumbbell, and the biotin end of the molecule is able to conjugate to an avidin protein. The avidin can strongly conjugate up to four biotin molecules. Changing the ratios of biotin to nanodumbbells leads to the formation of dimers, trimers, and flowerlike structures. To further improve the distribution of chain lengths, a separation method based upon weight was applied using a concentration gradient. The gold tips provide effective anchor points for constructing complex nanorod structures by self-assembly. 相似文献
33.
Jan?HladkyView authors OrcID profile Asaf?NachmiasEmail author Tuan?Tran 《Journal of statistical physics》2018,173(3-4):502-545
Let G be a connected graph in which almost all vertices have linear degrees and let \(\mathcal {T}\) be a uniform spanning tree of G. For any fixed rooted tree F of height r we compute the asymptotic density of vertices v for which the r-ball around v in \(\mathcal {T}\) is isomorphic to F. We deduce from this that if \(\{G_n\}\) is a sequence of such graphs converging to a graphon W, then the uniform spanning tree of \(G_n\) locally converges to a multi-type branching process defined in terms of W. As an application, we prove that in a graph with linear minimum degree, with high probability, the density of leaves in a uniform spanning tree is at least \(e^{-1}-\mathsf {o}(1)\), the density of vertices of degree 2 is at most \(e^{-1}+\mathsf {o}(1)\) and the density of vertices of degree \(k\geqslant 3\) is at most \({(k-2)^{k-2} \over (k-1)! e^{k-2}} + \mathsf {o}(1)\). These bounds are sharp. 相似文献
34.
We propose a method based on the electromagnetically induced transparency (EIT) phenomenon for the detection of molecules which exist as a small minority in the presence of a majority of absorbers. The EIT effect we employ effectively eliminates the absorption of the majority species in the spectral region where it overlaps with the absorption of the minority species. The method can also be used to enhance local-modes transitions which overlap spectrally with a background of other local-modes transitions of the same molecule. The general theory is applied to the case of sparse and congested background spectra within the same molecule and to the recording of the spectra of isotopomers (of chlorine and methanol) that are in minority relative to other isotopomers which constitute the majority of molecules present. 相似文献
35.
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has, in every column, blocks of consecutive 1s, each corresponding to a shift. We focus on three types of shift scheduling problems classified according to the column structure in the constraint matrix: columns of consecutive 1s, columns of cyclical 1s, and columns of k consecutive blocks. In particular, the complexity of the cyclical scheduling problem, where the matrix satisfies the property of cyclical 1s in each column, was noted recently by Hochbaum and Tucker to be open. They further showed that the unit demand case is polynomially solvable. Here we extend this result to the uniform requirements case, and provide a 2-approximation algorithm for the non-uniform case. We also establish that the cyclical scheduling problem’s complexity is equivalent to that of the exact matching problem—a problem the complexity status of which is known to be randomized polynomial (RP). We then investigate the three types of shift scheduling problems and show that, while the consecutive ones version is polynomial and the k-block columns version is NP-hard (for k≥2), for the k-blocks problem we give a simple k-approximation algorithm, which is the first approximation algorithm determined for the problem. 相似文献
36.
Let Φ be a set of general boolean functions on n variables, such that each function depends on exactly k variables, and each variable can take a value from [1,d]. We say that Φ is ε-far from satisfiable, if one must remove at least εnk functions in order to make the set of remaining functions satisfiable. Our main result is that if Φ is ε-far from satisfiable, then most of the induced sets of functions, on sets of variables of size c(k,d)/ε2, are not satisfiable, where c(k,d) depends only on k and d. Using the above claim, we obtain similar results for k-SAT and k-NAEQ-SAT.Assume we relax the decision problem of whether an instance of one of the above mentioned problems is satisfiable or not, to the problem of deciding whether an instance is satisfiable or ε-far from satisfiable. While the above decision problems are NP-hard, our result implies that we can solve their relaxed versions, that is, distinguishing between satisfiable and ε-far from satisfiable instances, in randomized constant time.From the above result we obtain as a special case, previous results of Alon and Krivelevich, and of Czumaj and Sohler, concerning testing of graphs and hypergraphs colorability. We also discuss the difference between testing with one-sided and two-sided error. 相似文献
37.
38.
39.
We prove packing and counting theorems for arbitrarily oriented Hamilton cycles in (n, p) for nearly optimal p (up to a factor). In particular, we show that given t = (1 ? o(1))np Hamilton cycles C1,…,Ct, each of which is oriented arbitrarily, a digraph ~(n, p) w.h.p. contains edge disjoint copies of C1,…,Ct, provided . We also show that given an arbitrarily oriented n‐vertex cycle C, a random digraph ~(n, p) w.h.p. contains (1 ± o(1))n!pn copies of C, provided . 相似文献
40.
Let fr(n,v,e) denote the maximum number of edges in an r-uniform hypergraph on n vertices, which does not contain e edges spanned by v vertices. Extending previous results of Ruzsa and Szemerédi and of Erdős, Frankl and R?dl, we partially resolve a problem
raised by Brown, Erdős and Sós in 1973, by showing that for any fixed 2≤k<r, we have
* Researchs upported in part by a USA-Israeli BSF grant, by the Israel Science Foundation and by the Hermann Minkowski Minerva
Center for Geometry at Tel Aviv University.
† This work forms part of the author's Ph.D. Thesis. Research supported by a Charles Clore Foundation Fellowship and an IBM
Ph.D. Fellowship. 相似文献