全文获取类型
收费全文 | 99篇 |
免费 | 4篇 |
国内免费 | 1篇 |
专业分类
化学 | 36篇 |
晶体学 | 2篇 |
力学 | 3篇 |
数学 | 21篇 |
物理学 | 42篇 |
出版年
2020年 | 2篇 |
2017年 | 1篇 |
2016年 | 2篇 |
2015年 | 2篇 |
2014年 | 1篇 |
2013年 | 1篇 |
2012年 | 1篇 |
2011年 | 7篇 |
2010年 | 2篇 |
2009年 | 4篇 |
2008年 | 1篇 |
2007年 | 3篇 |
2006年 | 2篇 |
2005年 | 1篇 |
2004年 | 4篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 4篇 |
1984年 | 3篇 |
1983年 | 6篇 |
1982年 | 2篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1972年 | 1篇 |
1933年 | 1篇 |
1912年 | 1篇 |
1911年 | 1篇 |
1909年 | 1篇 |
排序方式: 共有104条查询结果,搜索用时 62 毫秒
91.
A miniaturised flow-through biosensor with a cell volume of only a few nanoliters was developed in our laboratory. The biosensor can be directly coupled to a microdialysis or ultrafiltration probe. Sampling and continuous on-line monitoring can thus be carried out at submicroliter levels and as a consequence quantitative recoveries of the analyte of interest are achieved. Via this method excessive calibration procedures, as are necessary with conventional microdialysis, are avoided. Here, the construction and the performance of such a biosensor for the continuous on-line monitoring of glucose and lactate will be presented. The biosensor is based on the amperometric detection of hydrogen peroxide after conversion of the analyte of interest by an immobilised oxidoreductase enzyme. Immobilisation of the enzyme is performed through electropolymerisation of m-phenylenediamine. Strategies to improve the performance (e.g. linearity, selectivity and stability) of the miniaturised biosensor are discussed and ex vivo and in vivo experiments carried out thus far demonstrate the potential of this miniaturised flow-through biosensor. 相似文献
92.
C. Boekema P. C. Jonker G. Filoti F. Van Der Woude G. A. Sawatzky 《Hyperfine Interactions》1979,7(1):45-60
The effects of doping the orthoferrite LaFeO3 with Ga, Ni, Cr, Sc and Al on the hyperfine fields at the57Fe nuclei are investigated and discussed. The dependence of the magnetic hyperfine field at 4.2 K on the kind of nearest neighbour can be described in terms of a supertransfer model based upon the LCAO method. 相似文献
93.
6-(3-Methyl-but-2-enyl)-1,3-dihydro-indol-2-one, annonidine F [3-[6-(3-methyl-but-2-enyl)-1H-indolyl]-6-(3-methyl-but-2-enyl)-1H-indole], 1H-indole-5-carbaldehyde, 6-(3-methyl-2-butenyl)-1H-indole, 6-(3-methyl-buta-1,3-dienyl)-1H-indole, 6-(4-oxo-but-2-enyl)-1H-indole and 3-geranylindole were isolated from Monodora angolensis (Annonaceae) while 3-(1,1-dimethyl-but-2-enyl)-5-(3-methyl-but-2-enyl)-1H-indole (caulidine A), 4-[3-(1,1-dimethyl-but-2-enyl)-1H-indol-5-yl]-but-3-en-2-one (caulidine B), 5-(3-methyl-2-butenyl)-1H-indole and 5-(3-methylbuta-1,3-dienyl)-1H-indole were obtained from Isolona cauliflora (Annonaceae); structural determination by spectroscopic analysis. Some of the prenylindoles had antifungal and antimalarial activities. 相似文献
94.
95.
W. P. A. Jonker 《Colloid and polymer science》1912,10(3):126-131
Ohne Zusammenfassung(Zweite Mitteilung.) 相似文献
96.
We consider families of optimization problems with quadratic object function and affine linear constraints, which depend smoothly on one real parameter. For a generic subclass of such problems only three different types of (generalized) critical points occur, whereas in the general case (of nonlinear one-parameter families of constrained optimization problems on R n ) five types are to be distinguished. We clarify the theoretical background of these phenomena and illustrate the underlying mechanism with simple examples. 相似文献
97.
98.
99.
100.
We discuss generalized travelling-salesman problems where nodes are visited either once or not, and a penalty cost is incurred for each unvisited node. The generalization includes the longest-path problem and the shortest-path problem with specified nodes to be visited. A new transformation of generalized into standard travelling-salesman problem is presented. We give computational results for the shortest-path problem with specified nodes. The transformation makes it possible to solve symmetric problems with a relatively large number of specified nodes, which cannot be solved by previously published algorithms based on a linear assignment relaxation. Furthermore, we show how to obtain improved lower bounds for a special Euclidean-type variant. 相似文献