全文获取类型
收费全文 | 1134篇 |
免费 | 64篇 |
国内免费 | 2篇 |
专业分类
化学 | 685篇 |
晶体学 | 5篇 |
力学 | 21篇 |
数学 | 298篇 |
物理学 | 191篇 |
出版年
2023年 | 9篇 |
2022年 | 13篇 |
2021年 | 17篇 |
2020年 | 18篇 |
2019年 | 31篇 |
2018年 | 33篇 |
2017年 | 26篇 |
2016年 | 86篇 |
2015年 | 44篇 |
2014年 | 51篇 |
2013年 | 84篇 |
2012年 | 101篇 |
2011年 | 105篇 |
2010年 | 49篇 |
2009年 | 46篇 |
2008年 | 73篇 |
2007年 | 56篇 |
2006年 | 60篇 |
2005年 | 53篇 |
2004年 | 36篇 |
2003年 | 28篇 |
2002年 | 18篇 |
2001年 | 10篇 |
2000年 | 11篇 |
1999年 | 3篇 |
1998年 | 7篇 |
1997年 | 6篇 |
1996年 | 6篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 7篇 |
1992年 | 3篇 |
1991年 | 12篇 |
1990年 | 12篇 |
1989年 | 10篇 |
1988年 | 5篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1985年 | 2篇 |
1984年 | 8篇 |
1983年 | 4篇 |
1982年 | 3篇 |
1981年 | 6篇 |
1980年 | 8篇 |
1978年 | 4篇 |
1973年 | 2篇 |
1972年 | 3篇 |
1963年 | 2篇 |
1961年 | 1篇 |
1909年 | 1篇 |
排序方式: 共有1200条查询结果,搜索用时 15 毫秒
1.
We build a metric space which is homeomorphic to a Cantor set but cannot be realized as the attractor of an iterated function system. We give also an example of a Cantor set K in R3 such that every homeomorphism f of R3 which preserves K coincides with the identity on K. 相似文献
2.
3.
Let (E, ¦·¦) be a uniformly convex Banach space with the modulus of uniform convexity of power type. Let be the convolution of the distribution of a random series inE with independent one-dimensional components and an arbitrary probability measure onE. Under some assumptions about the components and the smoothness of the norm we show that there exists a constant such that |{·<t}–{·+r<t}|r
q
, whereq depends on the properties of the norm. We specify it in the case ofL
spaces, >1. 相似文献
4.
Herbert Edelsbrunner Leonidas Guibas Micha Sharir 《Discrete and Computational Geometry》1990,5(1):197-216
We consider several problems involving points and planes in three dimensions. Our main results are: (i) The maximum number of faces boundingm distinct cells in an arrangement ofn planes isO(m
2/3
n logn +n
2); we can calculatem such cells specified by a point in each, in worst-case timeO(m
2/3
n log3
n+n
2 logn). (ii) The maximum number of incidences betweenn planes andm vertices of their arrangement isO(m
2/3
n logn+n
2), but this number is onlyO(m
3/5–
n
4/5+2
+m+n logm), for any>0, for any collection of points no three of which are collinear. (iii) For an arbitrary collection ofm points, we can calculate the number of incidences between them andn planes by a randomized algorithm whose expected time complexity isO((m
3/4–
n
3/4+3
+m) log2
n+n logn logm) for any>0. (iv) Givenm points andn planes, we can find the plane lying immediately below each point in randomized expected timeO([m
3/4–
n
3/4+3
+m] log2
n+n logn logm) for any>0. (v) The maximum number of facets (i.e., (d–1)-dimensional faces) boundingm distinct cells in an arrangement ofn hyperplanes ind dimensions,d>3, isO(m
2/3
n
d/3 logn+n
d–1). This is also an upper bound for the number of incidences betweenn hyperplanes ind dimensions andm vertices of their arrangement. The combinatorial bounds in (i) and (v) and the general bound in (ii) are almost tight.Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by NSF Grant CCR-8714565. Work by the third author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant DCR-82-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. An abstract of this paper has appeared in theProceedings of the 13th International Mathematical Programming Symposium, Tokyo, 1988, p. 147. 相似文献
5.
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. 相似文献
6.
M. Adamus N. M. Agababyan I. V. Ajinenko Yu. A. Belokopytov H. Bia?kowska H. B?ttcher P. V. Chliapnikov F. Crijns A. De Roeck E. A. De Wolf K. Dziunikowska A. M. F. Endler W. Friebel H. Graessler P. van Hal J. K. Karamyan D. Kisielewska W. Kittel A. I. Kurnosenko B. B. Levchenko F. Meijers M. Merk A. B. Micha?owska V. I. Nikolaenko L. C. S. Oliveira K. Olkiewicz V. M. Ronjin A. M. Rybin H. M. T. Saarikko Y. T. M. Saarikko W. Schmitz L. Scholten N. A. Sotnikova J. Stepaniak O. G. Tchikilev L. A. Tikhonova V. A. Uvarov F. Verbeure R. Wischnewski EHS/NA Collaboration 《Zeitschrift fur Physik C Particles and Fields》1988,37(2):215-229
The charged particle multiplicity distribution has been studied for non-single-diffractive π+ p andpp collisions at \(\sqrt s = 22\) GeV, for full phase space as well as for intervals in rapidity, azimuthal angle and transverse momentum. In general, the multiplicity distribution is well described by a negative binomial. From comparison of the distribution for negative or positive particles to that of all charged particles, cascading is favoured as an interpretation over stimulated emission. Interesting consequences follow from a comparison of our results to those at collider energies and toe + e ? data at comparable energy. Furthermore, evidence is given that the multiplicity distribution is not exactly of negative binomial type in every (connected or disconnected) phase space region. 相似文献
7.
V. V. Aivazyan I. V. Ajinenko Yu. A. Belokopytov P. C. Bosetti H. B?ttcher F. Botterweck P. V. Chliapnikov F. Crijns A. De Roeck E. A. De Wolf Th. Driever K. Dziunikowska A. Eskreys W. Friebel Z. C. Garutchava V. G. Gavrjusev H. Graessler P. van Hal T. Haupt W. Kittel S. S. Megrabyan F. Meijers A. B. Micha?owska V. I. Nikolaenko L. C. S. Oliveira K. Olkiewicz L. P. Petrovikh E. Riipinen V. M. Ronjin A. M. Rybin H. M. T. Saarikko W. Schmitz L. Scholten R. Schulte O. G. Tchikilev L. A. Tikhonova A. G. Tomaradze V. A. Uvarov F. Verbeure R. Wischnewski A. Wróblewski S. A. Zotkin NA Collaboration 《Zeitschrift fur Physik C Particles and Fields》1989,42(4):533-542
Forward-backward multiplicity correlations in σ+,K + p andpp collisions at 250 GeV/c ( \(\sqrt s \) =22 GeV) are given for all charges and for the different charge combinations. The correlations are found to be caused predominantly by centrally produced particles. It is demonstrated that this result is an agreement with observations at the ISR and the CERNp \(\bar p\) -Collider. The results are compared to expectations from LUND, DPM and FRITIOF Monte Carlo models and a geometrical picture relating correlations in hadron-hadron collisions toe + e ? data in terms of impact parameters is tested. 相似文献
8.
pH gradient high-performance liquid chromatography (HPLC) is a method of reversed-phase high-performance liquid chromatography suitable for ionogenic substances. It consists in programmed increase during the chromatographic process of the eluting strength of eluent with respect to the analytes separated. On the analogy of the conventional organic modifier gradient reversed-phase HPLC, in the pH gradient approach the eluting strength of the mobile phase increases due to its changing pH: increasing in case of acids or decreasing in case of bases. At the same time the content of organic modifier remains constant. A theory of the pH gradient HPLC has been elaborated. The resulting mathematical model is easily manageable. Its ability to predict changes in retention and separation of analytes following the changes in chromatographic conditions is demonstrated. The pH gradient method is uniquely suitable to determine pKa values of analytes. An equation is presented allowing to calculate pKa values basing on appropriate retention data. The effects on pKa are discussed of the concentration of methanol in the mobile phase. The RP HPLC-derived pKa data correlate to the reference pKa values (w(w)pKa) but are not identical. That may be explained by the effects on the chromatographically determined pKa of the specific interactions of analytes with stationary phases. The proposed pH gradient RP HPLC procedure offers a fast and convenient means to get comparable acidity parameters for larger series of compounds, like drug candidates, also when the analytes are available only in minute amounts and/or as complex mixtures. 相似文献
9.
We have studied the diffusion inside the silica network of sodium atoms initially located outside the surfaces of an amorphous silica film. We have focused our attention on structural and dynamical quantities, and we have found that the local environment of the sodium atoms is close to the local environment of the sodium atoms inside bulk sodo-silicate glasses obtained by quench. This is in agreement with recent experimental results. 相似文献
10.
Flow-injection chemiluminescence determination of epinephrine in pharmaceutical preparations using raw apple juice as enzyme source 总被引:3,自引:0,他引:3
Raw apple juice exhibits the activity of polyphenol oxidase which can be employed for the determination of mono-, di- and polyhydric phenols. The chemiluminescence detection in the two-channel manifold was used to develop the new procedure for determination of epinephrine. Epinephrine can be determined by this method in pharmaceutical preparations in concentration ranges 1.0–10.0 and 10.0–25.0 mg l−1, with a detection limit of 0.2 mg l−1. Good selectivity against typical antioxidants and other coexisting substances was achieved. Relatively slow loss of the enzyme activity was observed during 1 week. The proposed method is very simple. Fresh juice solution from one apple can be prepared in 10 min and used for at least 8 h with excellent precision. Consumption of luminol solution was 0.15 ml min−1. The throughput was 20 samples per hour. 相似文献