全文获取类型
收费全文 | 3197篇 |
免费 | 138篇 |
国内免费 | 7篇 |
专业分类
化学 | 2369篇 |
晶体学 | 37篇 |
力学 | 36篇 |
数学 | 427篇 |
物理学 | 473篇 |
出版年
2023年 | 16篇 |
2022年 | 17篇 |
2021年 | 40篇 |
2020年 | 58篇 |
2019年 | 60篇 |
2018年 | 27篇 |
2017年 | 39篇 |
2016年 | 92篇 |
2015年 | 96篇 |
2014年 | 117篇 |
2013年 | 156篇 |
2012年 | 164篇 |
2011年 | 211篇 |
2010年 | 140篇 |
2009年 | 108篇 |
2008年 | 169篇 |
2007年 | 182篇 |
2006年 | 150篇 |
2005年 | 147篇 |
2004年 | 130篇 |
2003年 | 103篇 |
2002年 | 108篇 |
2001年 | 65篇 |
2000年 | 60篇 |
1999年 | 46篇 |
1998年 | 66篇 |
1997年 | 46篇 |
1996年 | 48篇 |
1995年 | 70篇 |
1994年 | 59篇 |
1993年 | 56篇 |
1992年 | 39篇 |
1991年 | 45篇 |
1990年 | 35篇 |
1989年 | 30篇 |
1988年 | 22篇 |
1987年 | 20篇 |
1986年 | 22篇 |
1985年 | 34篇 |
1984年 | 31篇 |
1983年 | 20篇 |
1982年 | 19篇 |
1981年 | 16篇 |
1980年 | 20篇 |
1979年 | 20篇 |
1978年 | 13篇 |
1977年 | 16篇 |
1975年 | 10篇 |
1973年 | 16篇 |
1966年 | 7篇 |
排序方式: 共有3342条查询结果,搜索用时 15 毫秒
11.
Steven Schmidt Gü nter Lattermann Ralf Kleppinger Joachim H. Wendorff 《Liquid crystals》1994,16(4):693-702
Liquid crystalline complexes with chromium, molybdenum and with tungsten as metallic centres are reported. 1,4,7-Trisubstituted 1,4,7-triazacyclononane and three carbonyl groups are coordinated in an octahedral geometry. The observed mesophases are characterized as disordered rectangular columnar of a pyramidic type. 相似文献
12.
We give cogenerators for the categories of convex (= finitely superconvex), finitely positively convex, and absolute convex (= finitely totally convex) spaces introduced by Pumplün and Röhrl.Dedicated to our academic teacher Dieter Pumplün on the occasion of his sixtieth birthday. 相似文献
13.
Rainer Koch Ralf Becker 《Journal of Quantitative Spectroscopy & Radiative Transfer》2004,84(4):423-435
After reviewing the presently available quadrature schemes for the discrete ordinates method, the accuracy of different schemes is analyzed and evaluated. It is shown from a comprehensive error analysis that the moment conditions have to satisfied not only for the principal coordinates directions, as it is mostly carried out, but for any arbitrary test direction. Among the schemes with approximately 50 discrete ordinates the DCT-020-2468 quadrature was found to give the best accuracy. The highest accuracy among all schemes is achieved by the LC-11 quadrature which requires 96 discrete ordinates. This scheme is rarely used up to date and deserves more attention for high accuracy predictions. 相似文献
14.
15.
Timur Seidel Alfred Golloch Hans Beerwald Günther Böhm 《Fresenius' Journal of Analytical Chemistry》1993,347(3-4):92-102
Summary A new analytical radiation source combined with fiber optics linked to a diode array detection device with modified software is described. The direct-reading spectrometer simultaneously covers the wavelength range 185–510 nm with a spectral resolution of <1.5 nm. Intense optical emission is observed when positionally stable high-current surface sparks supplied by a pulse-generator with definite discharge parameters (max. 800 Ampere/pulse) are sliding over compact non-conductive materials such as plastics, glasses, quartz filters or powder pellets. Substrate vaporization, ionization and excitation processes in the surface discharge plasma channel generate emission corresponding to neutral and ionic states. The spectra are essentially composed of lines emitted by the electrode material (e.g. copper, silver), from the substrate under investigation, radiation continuum as well as structured background from the surrounding air atmosphere. Due to the occurrence of emission lines of reactive fillers, inorganic pigments and stabilizers, a rapid multi-element screening method is demonstrated. A rapid identification system (mix-up test) of PVC or fire-retardant thermoplastics within one second has been realized from the atomic emission line intensity originating from the sputtered copper electrode material according to its increased volatility in the presence of chlorine (modified Beilstein test).Puls-Plasma-Technik GmbH, Dortmund 相似文献
16.
17.
Herbert Edelsbrunner Leonidas Guibas John Hershberger Raimund Seidel Micha Sharir Jack Snoeyink Emo Welzl 《Discrete and Computational Geometry》1989,4(1):433-466
Anarrangement ofn lines (or line segments) in the plane is the partition of the plane defined by these objects. Such an arrangement consists ofO(n
2) regions, calledfaces. In this paper we study the problem of calculating and storing arrangementsimplicitly, using subquadratic space and preprocessing, so that, given any query pointp, we can calculate efficiently the face containingp. First, we consider the case of lines and show that with (n) space1 and (n
3/2) preprocessing time, we can answer face queries in (n)+O(K) time, whereK is the output size. (The query time is achieved with high probability.) In the process, we solve three interesting subproblems: (1) given a set ofn points, find a straight-edge spanning tree of these points such that any line intersects only a few edges of the tree, (2) given a simple polygonal path , form a data structure from which we can find the convex hull of any subpath of quickly, and (3) given a set of points, organize them so that the convex hull of their subset lying above a query line can be found quickly. Second, using random sampling, we give a tradeoff between increasing space and decreasing query time. Third, we extend our structure to report faces in an arrangement of line segments in (n
1/3)+O(K) time, given(n
4/3) space and (n
5/3) preprocessing time. Lastly, we note that our techniques allow us to computem faces in an arrangement ofn lines in time (m
2/3
n
2/3+n), which is nearly optimal.The first author is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565. Work on this paper by the fifth author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. The sixth author was supported in part by a National Science Foundation Graduate Fellowship. This work was begun while the non-DEC authors were visiting at the DEC Systems Research Center. 相似文献
18.
This paper proves that any set of n points in the plane contains two points such that any circle through those two points encloses at least
points of the set. The main ingredients used in the proof of this result are edge counting formulas for k-order Voronoi diagrams and a lower bound on the minimum number of semispaces of size at most k.Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by the National Science Foundation under Grant CCR-8714565, by the second author has been partially supported by the Digital Equipment Corporation, by the fourth author has been partially supported by the Office of Naval Research under Grant N00014-86K-0416. 相似文献
19.
20.