全文获取类型
收费全文 | 623篇 |
免费 | 18篇 |
专业分类
化学 | 233篇 |
晶体学 | 3篇 |
力学 | 12篇 |
数学 | 250篇 |
物理学 | 143篇 |
出版年
2022年 | 4篇 |
2021年 | 5篇 |
2020年 | 6篇 |
2019年 | 14篇 |
2018年 | 9篇 |
2017年 | 8篇 |
2016年 | 13篇 |
2015年 | 15篇 |
2014年 | 10篇 |
2013年 | 21篇 |
2012年 | 29篇 |
2011年 | 32篇 |
2010年 | 18篇 |
2009年 | 9篇 |
2008年 | 29篇 |
2007年 | 34篇 |
2006年 | 33篇 |
2005年 | 22篇 |
2004年 | 18篇 |
2003年 | 18篇 |
2002年 | 18篇 |
2001年 | 17篇 |
2000年 | 12篇 |
1999年 | 7篇 |
1998年 | 11篇 |
1997年 | 14篇 |
1996年 | 14篇 |
1995年 | 11篇 |
1994年 | 13篇 |
1993年 | 9篇 |
1992年 | 15篇 |
1991年 | 13篇 |
1990年 | 6篇 |
1989年 | 10篇 |
1988年 | 7篇 |
1987年 | 13篇 |
1986年 | 15篇 |
1985年 | 14篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 6篇 |
1974年 | 5篇 |
1968年 | 6篇 |
1932年 | 2篇 |
排序方式: 共有641条查询结果,搜索用时 46 毫秒
1.
What is the largest number of edges in a graph of order n and girth g? For d-regular graphs, essentially the best known answer is provided by the Moore bound. This result is extended here to cover irregular
graphs as well, yielding an affirmative answer to an old open problem ([4] p. 163, problem 10).
Received: June 27, 2000 Final version received: July 3, 2001 相似文献
2.
Michael S. Donovan Andrew B. Lowe Taylor A. Sanford Charles L. McCormick 《Journal of polymer science. Part A, Polymer chemistry》2003,41(9):1262-1281
A novel bifunctional acrylamido‐based reversible addition–fragmentation chain transfer (RAFT) chain‐transfer agent (CTA), N,N′‐ethylenebis[2‐(thiobenzoylthio)propionamide] (CTA2), has been synthesized and used for the controlled free‐radical polymerization of N,N‐dimethylacrylamide (DMA). A comparative study of CTA2 and the monofunctional CTA N,N‐dimethyl‐s‐thiobenzoylthiopropionamide (CTA1) has been conducted. Polymerizations mediated by CTA1 result in poly(N,N‐dimethylacrylamide) (PDMA) homopolymers with unimodal molecular weight distributions, whereas CTA2 yields unimodal, bimodal, and trimodal distributions according to the extent of conversion. The multimodal nature of the PDMAs has been attributed to termination events and/or chains initiated by primary radicals. The RAFT polymerization of DMA with CTA2 also results in a prolonged induction period that may be attributed to the higher local concentration of dithioester functionalities early in the polymerization. A series of ω‐ and α,ω‐dithioester‐capped PDMAs have been prepared in organic media and subsequently employed as macro‐CTAs for the synthesis of diblock and triblock copolymers in aqueous media with the zwitterionic monomer 3‐[2‐(N‐methylacrylamido)‐ethyldimethylammonio] propane sulfonate (MAEDAPS). Additionally, an ω‐dithioester‐capped MAEDAPS homopolymer has been used as a macro‐CTA for the block polymerization of DMA. To our knowledge, this is the first example of a near‐monodisperse, sulfobetaine‐containing block copolymer prepared entirely in aqueous media. The diblock and triblock copolymers form aggregates in pure water that can be dissociated by the addition of salt, as determined by 1H NMR spectroscopy and dynamic light scattering. In pure water, highly uniform, micellelike aggregates with hydrodynamic diameters of 71–93 nm are formed. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 1262–1281, 2003 相似文献
3.
We prove that for every fixed k and ? ≥ 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 ?. This answers an open question of Chung. Our techniques provide also a characterization of all subgraphs H of the hypercube which are Ramsey, that is, have the property that for every k, any k‐edge coloring of a sufficiently large Qn contains a monochromatic copy of H. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 196–208, 2006 相似文献
4.
Peter G. Doyle Colin Mallows Alon Orlitsky Larry Shepp 《Israel Journal of Mathematics》1989,67(1):34-42
Letn cells be arranged in a ring, or alternatively, in a row. Initially, all cells are unmarked. Sequentially, one of the unmarked
cells is chosen at random and marked until, aftern steps, each cell is marked. After thekth cell has been marked the configuration of marked cells defines some number of islands: maximal sets of adjacent marked
cells. Let ξ
k
denote the random number of islands afterk cells have been marked.
We give explicit expressions for moments of products of ξ
k
’s and for moments of products of 1/ξ
k
’s.
These are used in a companion paper to prove that if a random graph on the natural number is made by drawing an edge betweeni≧1 andj>i with probabilityλ/j, then the graph is almost surely connected ifλ>1/4 and almost surely disconnected ifλ≦1/4. 相似文献
5.
Thomas J. Cloonan Gaylord W. Richards Anthony L. Lentine Frederick B. McCormick John R. Erickson 《Optical and Quantum Electronics》1992,24(4):S415-S442
Free-space optical implementations of switching networks have been proposed to circumvent many of the system-level problems that may be encountered in systems that require many high-density, high-bandwidth connections. The details of a new class of switching network (the EGS network), that is well-suited to free-space implementations, is described. The common control injection problem that plagues most free-space photonic networks, i.e. how can control information from an electronic source be injected into the network for applications that require relatively high network reconfiguration rates, is examined. A new technique for control injection, called embedded control, which permits network operation even with relatively high network reconfiguration rates is also proposed. 相似文献
6.
Noga Alon Oded Goldreich Johan Hstad Ren Peralta 《Random Structures and Algorithms》1992,3(3):289-304
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 + o(1)) (log log n + k/2 + log k + log 1/?), where ? is the statistical difference between the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recently presented by Naor and Naor (our size bound is better as long as ? < 1/(k log n)). An additional advantage of our constructions is their simplicity. 相似文献
7.
Letm 3 andk 1 be two given integers. Asub-k-coloring of [n] = {1, 2,...,n} is an assignment of colors to the numbers of [n] in which each color is used at mostk times. Call an
arainbow set if no two of its elements have the same color. Thesub-k-Ramsey number sr(m, k) is defined as the minimumn such that every sub-k-coloring of [n] contains a rainbow arithmetic progression ofm terms. We prove that((k – 1)m
2/logmk) sr(m, k) O((k – 1)m
2 logmk) asm , and apply the same method to improve a previously known upper bound for a problem concerning mappings from [n] to [n] without fixed points.Research supported in part by Allon Fellowship and by a Bat Sheva de-Rothschild grant.Research supported in part by the AKA Research Fund of the Hungarian Academy of Sciences, grant No. 1-3-86-264. 相似文献
8.
As is well known, Lovász Local Lemma implies that everyd-uniformd-regular hypergraph is 2-colorable, providedd 9. We present a different proof of a slightly stronger result; everyd-uniformd-regular hypergraph is 2-colorable, providedd 8.Research supported in part by Allon Fellowship and by a grant from the United States Israel Binational Science Foundation. 相似文献
9.
Forr2 letp(n, r) denote the maximum cardinality of a subsetA ofN={1, 2,...,n} such that there are noBA and an integery with
b=y
r. It is shown that for any>0 andn>n(), (1+o(1))21/(r+1)
n
(r–1)/(r+1)p(n, r)n
+2/3 for allr5, and that for every fixedr6,p(n, r)=(1+o(1))·21/(r+1)
n
(r–1)/(r+1) asn. Letf(n, m) denote the maximum cardinality of a subsetA ofN such that there is noBA the sum of whose elements ism. It is proved that for 3n
6/3+mn
2/20 log2
n andn>n(), f(n, m)=[n/s]+s–2, wheres is the smallest integer that does not dividem. A special case of this result establishes a conjecture of Erds and Graham.Research supported in part by Allon Fellowship, by a Bat-Sheva de Rothschild Grant and by the Fund for Basic Research administered by the Israel Academy of Sciences. 相似文献
10.
A regressive function (also called a regression or contractive mapping) on a partial order P is a function mapping P to itself such that (x)x. A monotone k-chain for is a k-chain on which is order-preserving; i.e., a chain x
1<...ksuch that (x
1)...(xk). Let P
nbe the poset of integer intervals {i, i+1, ..., m} contained in {1, 2, ..., n}, ordered by inclusion. Let f(k) be the least value of n such that every regression on P
nhas a monotone k+1-chain, let t(x,j) be defined by t(x, 0)=1 and t(x,j)=x
t(x,j–1). Then f(k) exists for all k (originally proved by D. White), and t(2,k) < f(K) <t( + k, k) , where k 0 as k. Alternatively, the largest k such that every regression on P
nis guaranteed to have a monotone k-chain lies between lg*(n) and lg*(n)–2, inclusive, where lg*(n) is the number of appliations of logarithm base 2 required to reduce n to a negative number. Analogous results hold for choice functions, which are regressions in which every element is mapped to a minimal element. 相似文献