全文获取类型
收费全文 | 2503篇 |
免费 | 102篇 |
出版年
2020年 | 40篇 |
2019年 | 42篇 |
2018年 | 55篇 |
2017年 | 49篇 |
2016年 | 84篇 |
2015年 | 57篇 |
2014年 | 58篇 |
2013年 | 571篇 |
2012年 | 91篇 |
2011年 | 92篇 |
2010年 | 84篇 |
2009年 | 80篇 |
2008年 | 71篇 |
2007年 | 62篇 |
2006年 | 67篇 |
2005年 | 37篇 |
2004年 | 20篇 |
2003年 | 27篇 |
2002年 | 35篇 |
2001年 | 41篇 |
2000年 | 29篇 |
1999年 | 34篇 |
1998年 | 29篇 |
1997年 | 30篇 |
1996年 | 38篇 |
1995年 | 31篇 |
1994年 | 33篇 |
1993年 | 33篇 |
1992年 | 32篇 |
1991年 | 34篇 |
1990年 | 17篇 |
1989年 | 25篇 |
1988年 | 24篇 |
1987年 | 32篇 |
1986年 | 27篇 |
1985年 | 27篇 |
1984年 | 36篇 |
1983年 | 31篇 |
1982年 | 35篇 |
1981年 | 21篇 |
1980年 | 34篇 |
1979年 | 32篇 |
1978年 | 20篇 |
1977年 | 18篇 |
1976年 | 19篇 |
1975年 | 14篇 |
1973年 | 19篇 |
1972年 | 18篇 |
1971年 | 19篇 |
1967年 | 21篇 |
排序方式: 共有2605条查询结果,搜索用时 15 毫秒
991.
992.
A new X-ray fluorescent analyser is described which uses a miniature X-ray tube or radioisotope source as alternative means of primary excitation. The advantages of this approach as compared to previous methods, particularly where elements low in the periodic table are concerned, is discussed. The second part of the paper describes an application of the technique. The non-destructive analysis of valuable ceramics, where elements low in the periodic table are important for differentiation purposes, has previously presented a problem. By using the ‘Isoprobe’such measurements are possible. In this instance the separation of early Chinese porcelains into Northern and Southern production groups is shown to be possible. Although samples have been ground from the wares for comparison with optical emission spectrometry, it is shown that analysis of the unglazed portions of the pots themselves gave similar results. 相似文献
993.
994.
995.
996.
997.
998.
The classical traveling-salesman problem involves the establishment of a tour around a set of points in a plane such that each point is intersected only once and the circuit is of minimal total length. When the length of a salesman's tour cannot exceed a specified constant, the problem becomes that of finding the fewest number of salesmen such that every city is visited by a salesman and the length of each salesman's tour does not exceed a specified constant. This is the chromatic traveling-salesmen problem. An algorithm for this problem is developed and is used to create periodic markets in parts of Sierra Leone. Fifteen rural areas were examined from Sierra Leone, and weekly market places were identified in each area. Salesmen were to be assigned to an area so that each market place was visited and each tour (or periodic ring) did not exceed forty hours. The chromatic traveling-salesmen algorithm was used to minimize the number of periodic rings needed for each area and provide the specific tour for each ring. 相似文献
999.
1000.