全文获取类型
收费全文 | 150篇 |
免费 | 0篇 |
专业分类
化学 | 76篇 |
晶体学 | 2篇 |
力学 | 5篇 |
数学 | 55篇 |
物理学 | 12篇 |
出版年
2021年 | 3篇 |
2020年 | 1篇 |
2018年 | 2篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2014年 | 3篇 |
2013年 | 11篇 |
2012年 | 5篇 |
2011年 | 1篇 |
2010年 | 3篇 |
2009年 | 3篇 |
2008年 | 1篇 |
2007年 | 5篇 |
2006年 | 11篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2003年 | 5篇 |
2002年 | 10篇 |
2001年 | 1篇 |
2000年 | 5篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 6篇 |
1982年 | 2篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1975年 | 1篇 |
1973年 | 1篇 |
1966年 | 2篇 |
1963年 | 1篇 |
排序方式: 共有150条查询结果,搜索用时 0 毫秒
1.
Andrew Vince 《Graphs and Combinatorics》1993,9(1):75-84
A short graph theoretic proof of the classification of closed surfaces is given. The new proof has the feature that the symmetric canonical graphs for the surfaces do not correspond to the canonical polygons in the usual proof of the classification. 相似文献
2.
Andrew Vince 《Journal of Graph Theory》2002,41(1):53-61
The concepts of separation index of a graph and of a surface are introduced. We prove that the separation index of the sphere is 3. Also the separation index of any graph faithfully embedded in a surface of genus g is bounded by a funtion of g. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 53–61, 2002 相似文献
3.
Vince Grolmusz 《Designs, Codes and Cryptography》2006,38(3):363-372
We define, construct and sketch possible applications of a new class of non-linear codes: co-orthogonal codes, with possible
applications in cryptography and parallel processing. We also describe a fast and general method for generating (non-linear)
codes with prescribed dot-products with the help of multi-linear polynomials. 相似文献
4.
The palladium-catalyzed coupling of the sodium salt of 7-amino-1,2,3-triazolo[4,5-d]pyrimidine (8-azaadenine, 1) with allylic phosphates or carbonates resulted in mixtures of 2- and 3-substituted 1,2,3-triazolopyrimidines, which were separated by chromatography. 1-Substituted triazolopyrimidines were not isolated from these reactions. Regioselectivity (and stereoselectivity) was also observed for substitution of the allylic moiety when more than one isomer is possible from the reaction. The use of 5-amino-1,2,3-triazolo[4,5-d]pyrimidin-7-ones (8-azaguanine, 2), instead of 8-azaadenine, also resulted in mixtures. Alternate syntheses of the 3-allyl-1,2,3-triazolo[4,5-d]pyrimidines confirmed the structures of these compounds. 相似文献
5.
Holder Alvin A. Brown Ross F. G. Marshall Sophia C. Payne Vince C. R. Cozier Maria D. Alleyne Walter A. Bovell Christopher O. 《Transition Metal Chemistry》2000,25(5):605-611
A detailed investigation of the oxidation of L-ascorbic acid (H2A) by the title complex has been carried out using conventional spectrophotometry at 510 nm, over the ranges: 0.010 [ascorbate]
T
0.045 mol dm–3, 3.62 pH 5.34, and 12.0 30.0 °C, 0.50 I 1.00 mol dm–3, and at ionic strength 0.60 mol dm–3 (NaClO4). The main reaction products are the bis(pyridine-2,6-dicarboxylate)cobaltate(II) ion and l-dehydroascorbic acid. The reaction rate is dependent on pH and the total ascorbate concentration in a complex manner, i.e., k
obs = (k
1
K
1)[ascorbate]
T
/(K
1 + [H+]). The second order rate constant, k
1 [rate constant for the reaction of the cobalt(III) complex and HA–] at 25.0 °C is 2.31 ± 0.13 mol–1 dm3 s–1. H
= 30 ± 4 kJ mol–1 and S
= –138 ± 13 J mol–1 K–1. K
1, the dissociation constant for H2A, was determined as 1.58 × 10–4 mol dm–3 at an ionic strength of 0.60 mol dm–3, while the self exchange rate constant, k
11 for the title complex, was determined as 1.28 × 10–5 dm3 mol–1 s–1. An outer-sphere electron transfer mechanism has been proposed. 相似文献
6.
Yang X Jones RA Lynch V Oye MM Holmes AL 《Dalton transactions (Cambridge, England : 2003)》2005,(5):849-851
Near infrared luminescence is observed in tetrametallic [Zn2Yb2L2(mu-OH)2Cl4].2MeCN which is obtained from the Zn3 Schiff-base complex [Zn3L2(NO3)2].MeOH, (H2L =N,N'-bis(5-bromo-3-methoxysalicylidene)propylene-1,3-diamine). 相似文献
7.
As a prelude to development of a human vaccine against Lyme disease, the first chemical synthesis of glycolipid antigens of Borrelia burkholderi is reported. First, cholesteryl β-d-galactopyranoside was synthesized and was converted to partially protected congeners having the HO-6 group of the galactose moiety unprotected. Treatment of these intermediates with palmitic and oleic acid, respectively, under dehydrative conditions followed by removal of the protecting groups afforded cholesteryl 6-O-palmitoyl/oleoyl-β-d-galactopyranosides that were identical to the glycolipids isolated from B. burkholderi. 相似文献
8.
9.
For a hypergraphG withv vertices ande i edges of sizei, the average vertex degree isd(G)= ∑ie 1/v. Callbalanced ifd(H)≦d(G) for all subhypergraphsH ofG. Let $$m(G) = \mathop {\max }\limits_{H \subseteqq G} d(H).$$ A hypergraphF is said to be abalanced extension ofG ifG?F, F is balanced andd(F)=m(G), i.e.F is balanced and does not increase the maximum average degree. It is shown that for every hypergraphG there exists a balanced extensionF ofG. Moreover everyr-uniform hypergraph has anr-uniform balanced extension. For a graphG let ext (G) denote the minimum number of vertices in any graph that is a balanced extension ofG. IfG hasn vertices, then an upper bound of the form ext(G) 1 n 2 is proved. This is best possible in the sense that ext(G)>c 2 n 2 for an infinite family of graphs. However for sufficiently dense graphs an improved upper bound ext(G) 3 n can be obtained, confirming a conjecture of P. Erdõs. 相似文献
10.
Summary. We have discovered a new implementation of the
qd algorithm that has a far wider domain of stability than Rutishauser's version. Our algorithm was
developed from an examination of the {Cholesky~LR} transformation and can be adapted
to parallel computation in stark contrast to traditional qd. Our algorithm also yields
useful a posteriori upper and lower bounds on the smallest singular
value of a bidiagonal matrix.
The zero-shift bidiagonal QR of Demmel and Kahan computes the smallest singular
values to maximal relative accuracy and the others to maximal absolute accuracy
with little or no degradation in efficiency when compared with the
LINPACK code. Our algorithm obtains maximal relative accuracy for all
the singular values and runs at least four times faster than the LINPACK code.
Received August 8, 1993/Revised version received May 26, 1993 相似文献