全文获取类型
收费全文 | 74篇 |
免费 | 1篇 |
专业分类
化学 | 33篇 |
数学 | 26篇 |
物理学 | 16篇 |
出版年
2022年 | 1篇 |
2021年 | 1篇 |
2019年 | 1篇 |
2016年 | 2篇 |
2014年 | 2篇 |
2013年 | 4篇 |
2012年 | 2篇 |
2011年 | 5篇 |
2010年 | 4篇 |
2009年 | 3篇 |
2008年 | 3篇 |
2007年 | 2篇 |
2006年 | 8篇 |
2005年 | 1篇 |
2004年 | 4篇 |
2002年 | 1篇 |
2000年 | 5篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1980年 | 2篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有75条查询结果,搜索用时 390 毫秒
1.
Supercritical fluid chromatography (SFC) with electron-capture detection is described for the sensitive quantification of mefloquine in 0.1-ml blood samples. The method is internally standardized and incorporates partitioning into methyl tert.-butyl ether (MTBE) from aqueous base, back-extraction into dilute aqueous acid and final partitioning into MTBE from aqueous base. SFC conditions include a silica-gel-packed, glass-lined steel column and a mobile phase of 0.15% n-butylamine and 1% methanol in supercritical n-pentane. The method has a detection limit of 7.5 ng/ml in 0.1-ml blood samples and exhibits good linearity and precision. The method compares favorably with a published high-performance liquid chromatographic procedure in the analysis of blood from volunteers who received mefloquine hydrochloride (15 mg as base per kg body weight). 相似文献
2.
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, but lower bounds show that if linear space is assumed, the problem cannot be solved in polylogarithmic time, except for the case of orthogonal ranges. In this paper we show that if one is willing to allow approximate ranges, then it is possible to do much better. In particular, given a bounded range Q of diameter w and >0, an approximate range query treats the range as a fuzzy object, meaning that points lying within distance w of the boundary of Q either may or may not be counted. We show that in any fixed dimension d, a set of n points in
can be preprocessed in O(n+logn) time and O(n) space, such that approximate queries can be answered in O(logn(1/)d) time. The only assumption we make about ranges is that the intersection of a range and a d-dimensional cube can be answered in constant time (depending on dimension). For convex ranges, we tighten this to O(logn+(1/)d−1) time. We also present a lower bound for approximate range searching based on partition trees of Ω(logn+(1/)d−1), which implies optimality for convex ranges (assuming fixed dimensions). Finally, we give empirical evidence showing that allowing small relative errors can significantly improve query execution times. 相似文献
3.
4.
We present a summary of precision atomic mass measurements of stable isotopes carried out at Florida State University. These include the alkalis 6Li, 23Na, 39,41K, 85,87Rb, 133Cs; the rare gas isotopes 84,86Kr and 129,130,132,136Xe; 17,18O, 19F, 28Si, 31P, 32S; and various isotope pairs of importance to neutrino physics, namely 74,76Se/74,76Ge, 130Xe/130Te, and 115In/115Sn. We also summarize our Penning trap measurements of the dipole moments of PH?+? and HCO?+?. 相似文献
5.
A covering of the Euclidean plane by a polygon P is a system of translated copies of P whose union is the plane, and a packing of P in the plane is a system of translated copies of P whose interiors are disjoint. A lattice covering is a covering in which the translates are defined by the points of a lattice, and a lattice packing is defined similarly. We show that, given a convex polygon P with n vertices, the densest lattice packing of P in the plane can be found in O(n) time. We also show that the sparsest lattice covering of the plane by a centrally symmetric convex polygon can be solved in O(n) time. Our approach utilizes results from classical geometry that reduce these packing and covering problems to the problems of finding certain extremal enclosed figures within the polygon. 相似文献
6.
AR Engel 《Contemporary Physics》2013,54(6):523-526
This article reviews some of the applications of physics to the solution of archaeological problems. The use of magnetic, resistivity and electromagnetic surveying techniques for the location of buried features is described. Various methods of age determination are outlined while the problems associated with radiocarbon dating of organic material and thermoluminescent dating of pottery are discussed in detail. The techniques, including petrological examination, chemical analysis and isotopic analysis, employed in the physical examination of archaeological artefacts are described. Examples of the application of these techniques in establishing the source of the raw materials used in pottery, metal and stone implements and in elucidating the techniques of manufacture of pottery and metal objects are also given. 相似文献
7.
8.
R.E. Ansorge J.R. Carter R.P. Mount W.W. Neale R. Raja J.G. Rushbrooke 《Nuclear Physics B》1975,97(3):439-444
We present data on the inclusive neutron spectra produced in the forward direction by the interactions of 23.85 GeV/c protons in a copper target. The results are in good agreement with the predictions of the triple-Regge model. 相似文献
9.
10.
K. R. Mount 《Mathematische Annalen》1973,203(4):289-294