全文获取类型
收费全文 | 1367篇 |
免费 | 25篇 |
国内免费 | 14篇 |
专业分类
化学 | 795篇 |
晶体学 | 6篇 |
力学 | 40篇 |
数学 | 325篇 |
物理学 | 240篇 |
出版年
2023年 | 6篇 |
2022年 | 16篇 |
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年 | 81篇 |
2006年 | 48篇 |
2005年 | 60篇 |
2004年 | 62篇 |
2003年 | 37篇 |
2002年 | 46篇 |
2001年 | 25篇 |
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篇 |
排序方式: 共有1406条查询结果,搜索用时 0 毫秒
141.
142.
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. 相似文献
143.
144.
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. 相似文献
145.
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. 相似文献
146.
147.
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 相似文献
148.
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. 相似文献
149.
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. 相似文献
150.
Direct simulations of macromolecular fluids are carried out for flows between parallel plates and in expanding and contracting channels. The macromolecules are modeled as FENE dumbbells with soft disks or Lennard-Jones dumbbell-dumbbell interactions. The results are presented in terms of profiles and contour plots of velocity, pressure, temperature, density, and flow fields. In addition the data for potential energy, shear stress, and the normal components of the stress tensor are collected. In general, an excellent agreement is found between the simulated profiles and the well-known flow structures, such as flow separation and formation of viscous eddies, indicating that micro-hydrodynamics is a viable tool in linking macroscopic phenomena with the underlying physical mechanisms. The simulations are performed in the Newtonian regime, for medium-size systems comprising up to 3888 dumbbells. This number is sufficiently large to control boundary and particle number effects. The flow is induced by gravity. The traditional stochastic (thermal) and periodic boundary conditions are employed. Also, diffusive boundary conditions, which could include a stagnant fluid layer and repulsive potential walls, are developed. The scaling problems, which are related to the application of a large external force in a microscopic system (of the size of the order 100 Å), result in extreme pressure and temperature gradients. In addition, the viscosity and thermal conductivity coefficients obtained from velocity and temperature profiles of the channel flow are presented. These results are confirmed independently from modeling of Couette flow by the SLLOD equations of motion and from the Evans algorithm for thermal conductivity. 相似文献