全文获取类型
收费全文 | 1340篇 |
免费 | 30篇 |
国内免费 | 14篇 |
专业分类
化学 | 789篇 |
晶体学 | 6篇 |
力学 | 40篇 |
数学 | 325篇 |
物理学 | 224篇 |
出版年
2023年 | 5篇 |
2022年 | 12篇 |
2021年 | 14篇 |
2020年 | 22篇 |
2019年 | 12篇 |
2018年 | 28篇 |
2017年 | 24篇 |
2016年 | 48篇 |
2015年 | 54篇 |
2014年 | 40篇 |
2013年 | 90篇 |
2012年 | 76篇 |
2011年 | 98篇 |
2010年 | 79篇 |
2009年 | 48篇 |
2008年 | 78篇 |
2007年 | 80篇 |
2006年 | 50篇 |
2005年 | 53篇 |
2004年 | 60篇 |
2003年 | 35篇 |
2002年 | 43篇 |
2001年 | 21篇 |
2000年 | 31篇 |
1999年 | 17篇 |
1998年 | 14篇 |
1997年 | 14篇 |
1996年 | 13篇 |
1995年 | 10篇 |
1994年 | 7篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 8篇 |
1990年 | 5篇 |
1984年 | 10篇 |
1983年 | 7篇 |
1981年 | 9篇 |
1980年 | 6篇 |
1978年 | 7篇 |
1977年 | 7篇 |
1975年 | 4篇 |
1974年 | 5篇 |
1966年 | 6篇 |
1965年 | 4篇 |
1962年 | 6篇 |
1959年 | 7篇 |
1958年 | 7篇 |
1957年 | 22篇 |
1956年 | 13篇 |
1955年 | 15篇 |
排序方式: 共有1384条查询结果,搜索用时 22 毫秒
91.
Bicyclic graphs for which the least eigenvalue is minimum 总被引:3,自引:0,他引:3
The spread of a graph is defined to be the difference between the greatest eigenvalue and the least eigenvalue of the adjacency matrix of the graph. In this paper we determine the unique graph with minimum least eigenvalue among all connected bicyclic graphs of order n. Also, we determine the unique graph with maximum spread in this class for each n?28. 相似文献
92.
Karel indel JiÍ Holubek Emil Svtek Olue Matouov Jiina Metyov Miroslav Protiva 《Journal of heterocyclic chemistry》1989,26(5):1325-1330
Reactions of dibenzo[b,e]thiepin-11(6H)-one (4) with 2-, 3- and 4-(dimethylaminomethyl)phenylmagnesium bromide afforded the tertiary alcohols 5a,b,c. The aldehydes 7 and 8 gave similarly the secondary alcohols 9a,b,c and 10c . Numerous attempts to prepare the corresponding ketones, especially by oxidation of 9a,b,c and 10c were unsuccessful. Only the oxidation of 9c with tetrabutylammonium chromate in chloroform afforded the desired ketone 16 . Its formation was accompanied by an important side reaction consisting in a cleavage of the “retro-ene-reaction” type leading to compound 11 and the aldehyde 13c which reacted with the chloroform present to give the alcohol 17 . Compounds 5a,b,c, 9a,b,c and 16 were tested as potential antidepressants but with the exception of some effects in the test of potentiation of yohimbine toxicity in mice, they proved inactive in this line. 相似文献
93.
Miroslav Hušek 《Topology and its Applications》2008,155(14):1493-1501
Three approaches to a direct construction of Urysohn universal space are compared, namely those of Urysohn, Hausdorff and Katětov. More details are devoted to the unpublished Hausdorff's approach that is shown to work in a more general situation, too. 相似文献
94.
95.
In this article we present results of rough surface scattering calculations using a graphical processing unit implementation of the Finite Difference in Time Domain algorithm. Numerical results are compared to real measurements and computational performance is compared to computer processor implementation of the same algorithm. As a basis for computations, atomic force microscope measurements of surface morphology are used. It is shown that the graphical processing unit capabilities can be used to speedup presented computationally demanding algorithms without loss of precision. 相似文献
96.
Petr Vlček Miroslav Janata Petra Látalová Jiří Dybal Milena Špírková Luděk Toman 《Journal of polymer science. Part A, Polymer chemistry》2008,46(2):564-573
Graft copolymers with cellulose diacetate (CDA) backbone and both the poly(ε‐caprolactone) and polystyrene, or poly(butyl acrylate) or PMMA grafts were prepared by two‐step process. First, ε‐caprolactone (CL) was polymerized by ring‐opening polymerization (ROP) initiated with CDA, partly funcionalized with 2‐bromo‐isobutyryl groups (degree of functionalization was 0.5). The p(CDA‐g‐CL) copolymers were used in the second step as polyfunctional macroinitiators of ATRP of the vinyl monomer, giving densely grafted copolymers with polyester and PSt, or PBuA, or PMMA grafts. The prepared copolymers were characterized by SEC, some of them also by FTIR spectroscopy and atomic force microscopy (AFM). © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 46: 564–573, 2008 相似文献
97.
The main result of the present note states that it is consistent with the ZFC axioms of set theory (relying on Martin's Maximum MM axiom), that every Asplund space of density character ω1 has a renorming with the Mazur intersection property. Combined with the previous result of Jiménez and Moreno (based upon the work of Kunen under the continuum hypothesis) we obtain that the MIP renormability of Asplund spaces of density ω1 is undecidable in ZFC. 相似文献
98.
Approximate expressions of sorptivity have been tested against the Philip's numerical solution for porous materials with a wide range of parameters used in an exponential function of the water diffusivityD versus water content. The Philip-Knight approximation offers the best result when the flux ratio is approximated by the function derived for a constant value ofD. 相似文献
99.
Miroslav Chlebík 《Discrete Applied Mathematics》2008,156(3):292-312
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science (WG’03), Lecture notes in computer science, vol. 2880, 2003, pp. 1-12, Kernelization algorithms for the vertex cover problem: theory and experiments, in: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, Louisiana, January 2004, pp. 62-69]. We describe in detail a close relation of crown reductions to Nemhauser and Trotter reductions that are based on the linear programming relaxation of the problem. We introduce and study the so-called strong crown reductions, suitable for finding (or counting) all minimum vertex covers, or finding a minimum vertex cover under some additional constraints. It is described how crown decompositions and strong crown decompositions suitable for such problems can be computed in polynomial time. For weighted König-Egerváry graphs (G,w) we observe that the set of vertices belonging to all minimum vertex covers, and the set of vertices belonging to no minimum vertex covers, can be efficiently computed.Further, for some specific classes of graphs, simple algorithms for the MIN-VC problem with a constant approximation factor r<2 are provided. On the other hand, we conclude that for the regular graphs, or for the Hamiltonian connected graphs, the problem is as hard to approximate as for general graphs.It is demonstrated how the results about strong crown reductions can be used to achieve a linear size problem kernel for some related vertex cover problems. 相似文献
100.
Miroslav Pohanka 《Chemical Papers》2017,71(9):1553-1561
Recently, there is an effort to introduce new types of analytical procedures and handheld assays to provide simple and reliable equipment for the field and household analyses. Development of diagnostic tools for self-diagnosis is another challenge in analytical chemistry. Digital cameras are widely available and cheap, hence they could be the sensor platform for construction of analytical and diagnostic methods. In general, good availability of cameras integrated into smartphones can be easily converted into an analytical tool. This review relates to the use of digital camera in analytical chemistry and there are introduced the facts how digital data can be processed and what the limits of digital photography are. Recent papers in this issue and discussion of development in camera based assays is also provided here. 相似文献