全文获取类型
收费全文 | 1401篇 |
免费 | 42篇 |
国内免费 | 14篇 |
专业分类
化学 | 839篇 |
晶体学 | 7篇 |
力学 | 22篇 |
数学 | 320篇 |
物理学 | 269篇 |
出版年
2023年 | 5篇 |
2022年 | 18篇 |
2021年 | 25篇 |
2020年 | 24篇 |
2019年 | 28篇 |
2018年 | 23篇 |
2017年 | 18篇 |
2016年 | 42篇 |
2015年 | 41篇 |
2014年 | 32篇 |
2013年 | 85篇 |
2012年 | 87篇 |
2011年 | 102篇 |
2010年 | 49篇 |
2009年 | 55篇 |
2008年 | 85篇 |
2007年 | 83篇 |
2006年 | 77篇 |
2005年 | 54篇 |
2004年 | 44篇 |
2003年 | 40篇 |
2002年 | 45篇 |
2001年 | 29篇 |
2000年 | 16篇 |
1999年 | 16篇 |
1998年 | 12篇 |
1997年 | 20篇 |
1996年 | 20篇 |
1995年 | 14篇 |
1994年 | 13篇 |
1993年 | 13篇 |
1992年 | 11篇 |
1991年 | 18篇 |
1990年 | 13篇 |
1989年 | 14篇 |
1988年 | 8篇 |
1987年 | 15篇 |
1986年 | 11篇 |
1985年 | 18篇 |
1984年 | 13篇 |
1983年 | 16篇 |
1982年 | 5篇 |
1981年 | 12篇 |
1980年 | 7篇 |
1979年 | 9篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1974年 | 7篇 |
1973年 | 7篇 |
1972年 | 8篇 |
排序方式: 共有1457条查询结果,搜索用时 156 毫秒
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.
Bogdanovskaya V. A. Grinberg V. A. Krishtalik L. I. Kuznetsov A. M. Pleskov Yu. V. Skundin A. M. Tarasevich M. R. Tsyrlina G. A. 《Russian Journal of Electrochemistry》2003,39(4):441-444
Russian Journal of Electrochemistry - 相似文献
3.
Starch belongs to the polyglucan group. This type of polysaccharide shows a broad β-relaxation process in dielectric spectra at low temperatures, which has its molecular origin in orientational motions of sugar rings via glucosidic linkages. This chain dynamic was investigated for α(1,4)-linked starch oligomers with well-defined chain lengths of 2, 3, 4, 6, and 7 anhydroglucose units (AGUs) and for α(1,4)-polyglucans with average degrees of polymerization of 5, 10, 56, 70, and so forth (up to 3000; calculated from the mean molecular weight). The activation energy (Ea) of the segmental chain motion was lowest for dimeric maltose (Ea = 49.4 ± 1.3 kJ/mol), and this was followed by passage through a maximum at a degree of polymerization of 6 (Ea = 60.8 ± 1.8 kJ/mol). Subsequently, Ea leveled off at a value of about 52 ± 1.5 kJ/mol for chains containing more than 100 repeating units. The results were compared with the values of cellulose-like oligomers and polymers bearing a β(1,4)-linkage. Interestingly, the shape of the Ea dependency on the chain length of the molecules was qualitatively the same for both systems, whereas quantitatively the starch-like substances generally showed higher Ea values. Additionally, and for comparison, three cyclodextrins were measured by dielectric relaxation spectroscopy. The ringlike molecules, with 6, 7, and 8 α(1,4)-linked AGUs, showed moderately different types of dielectric spectra. © 2003 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 188–197, 2004 相似文献
4.
In the present paper, Daubechies' wavelets and the computation of their scaling coefficients are briefly reviewed. Then a new method of computation is proposed. This method is based on the work [7] concerning a new orthonormality condition and relations among scaling moments, respectively. For filter lengths up to 16, the arising system can be explicitly solved with algebraic methods like Gröbner bases. Its simple structure allows one to find quickly all possible solutions. 相似文献
5.
D. Hugh Powell Andr E. Merbach Gabriel Gonzlez Ern Brücher Kroly Micskei M. Francesca Ottaviani Klaus Khler Alex Von Zelewsky Oleg Ya. Grinberg Yakob S. Lebedev 《Helvetica chimica acta》1993,76(5):2129-2146
EPR Spectra have been measured for aqueous solutions of a series of Gd3+ complexes at variable temperature and a range of magnetic fields; S-band (0.14 T), X-band (0.34 T), Q-band (1.2 T), and 2-mm-band (5.0 T). The major contribution to the observed line widths is magnetic-field-dependent and is interpreted as being due to the modulation of the zero-field splitting produced by distortion of the complexes from perfect symmetry. The transverse and longitudinal relaxation matrices for an 8S ion with such an interaction have been calculated using Redfield theory with vector-coupling methods, and diagonalised numerically to obtain relaxation rates and intensities for the degenerate transitions which contribute to the multiplet. The observed line width, which is inversely proportional to the magnetic field at low temperatures, is best described by the intensity-weighted mean transverse relaxation time for the four transitions with non-zero intensity. A least-squares fit of the data yields the square of the zero-field splitting tensor, Δ2, and a correlation time, τv, with activation energy, Ev. The physical significance of these parameters and the extent of validity of the theoretical approach are considered. The parameters are used to predict the magnetic-field dependence of the longitudinal and transverse electronic relaxation times, which are discussed in the context of their relevance to 1H-NMR relaxivity. 相似文献
6.
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 相似文献
7.
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. 相似文献
8.
A comparison of results of indirect and direct electrochemical fluorosulfation of nonsaturated fluorocarbons shows that the main or the only product in potentiostatic conditions is vicinal fluorosulfates. Owing to a high rate of the electrochemical step, which exceeds the rate of desorption of intermediate radicals from the electrode surface into solution, it is possible to improve the process selectivity by increasing the contribution of the ionic reaction route. 相似文献
9.
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. 相似文献
10.
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. 相似文献