全文获取类型
收费全文 | 1864篇 |
免费 | 4篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 3篇 |
综合类 | 4篇 |
化学工业 | 155篇 |
金属工艺 | 3篇 |
机械仪表 | 97篇 |
建筑科学 | 103篇 |
矿业工程 | 5篇 |
轻工业 | 527篇 |
水利工程 | 18篇 |
石油天然气 | 35篇 |
武器工业 | 2篇 |
无线电 | 115篇 |
一般工业技术 | 696篇 |
冶金工业 | 11篇 |
原子能技术 | 4篇 |
自动化技术 | 93篇 |
出版年
2012年 | 171篇 |
2011年 | 209篇 |
2010年 | 42篇 |
2009年 | 15篇 |
2008年 | 157篇 |
2007年 | 138篇 |
2006年 | 143篇 |
2005年 | 122篇 |
2004年 | 107篇 |
2003年 | 108篇 |
2002年 | 84篇 |
2001年 | 66篇 |
2000年 | 74篇 |
1999年 | 41篇 |
1998年 | 25篇 |
1997年 | 29篇 |
1996年 | 26篇 |
1995年 | 28篇 |
1994年 | 27篇 |
1993年 | 18篇 |
1992年 | 19篇 |
1991年 | 26篇 |
1990年 | 15篇 |
1989年 | 15篇 |
1988年 | 16篇 |
1987年 | 10篇 |
1986年 | 21篇 |
1985年 | 21篇 |
1984年 | 28篇 |
1983年 | 15篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1973年 | 3篇 |
1972年 | 1篇 |
1970年 | 1篇 |
1968年 | 1篇 |
1959年 | 3篇 |
1958年 | 4篇 |
1957年 | 1篇 |
1956年 | 3篇 |
1955年 | 1篇 |
1954年 | 4篇 |
1948年 | 3篇 |
1946年 | 1篇 |
排序方式: 共有1871条查询结果,搜索用时 15 毫秒
31.
32.
33.
34.
The thickness of a malignant nevus has been found to be an important prognostic factor for patients with melanoma. We have designed a new method of imaging nevi that permits their thickness to be measured in situ. Using fiber optics directed into the surrounding skin, we transilluminate the nevus. Three images are picked up by a digitizing TV camera: the vertical image (90 degrees ), a glancing image (180 degrees ), and one at 45 degrees , obtained by using two front-silvered mirrors held next to the nevus in a "nevoscope." The digitized images are used in a computed tomography algorithm to calculate approximate vertical cross sections of the nevus. The algorithm is one we recently developed to permit reconstruction from a very few projections. Our method is completely noninvasive. It may be used to check all the nevi on a patient. Without excisions, we could establish a baseline three-dimensional shape for each nevus, follow any changes in time, and obtain an early warning of increase in thickness and possible malignancy. 相似文献
35.
36.
37.
Bayesian recognition of local 3-d shape by approximating image intensity functions with quadric polynomials 总被引:2,自引:0,他引:2
The recognition in image data of viewed patches of spheres, cylinders, and planes in the 3-D world is discussed as a first step to complex object recognition or complex object location and orientation estimation. Accordingly, an image is partitioned into small square windows, each of which is a view of a piece of a sphere, or of a cylinder, or of a plane. Windows are processed in parallel for recognition of content. New concepts and techniques include approximations of the image within a window by 2-D quadric polynomials where each approximation is constrained by one of the hypotheses that the 3-D surface shape seen is either planar, cylindrical, or spherical; a recognizer based upon these approximations to determine whether the object patch viewed is a piece of a sphere, or a piece of a cylinder, or a piece of a plane; lowpass filtering of the image by the approximation. The shape recognition is computationally simple, and for large windows is approximately Bayesian minimum-probability-of-error recognition. These classifications are useful for many purposes. One such purpose is to enable a following processor to use an appropriate estimator to estimate shape, and orientation and location parameters for the 3-D surface seen within a window. 相似文献
38.
Crowley JL Stern RM 《IEEE transactions on pattern analysis and machine intelligence》1984,(2):212-222
This paper defines the difference of low-pass (DOLP) transform and describes a fast algorithm for its computation. The DOLP is a reversible transform which converts an image into a set of bandpass images. A DOLP transform is shown to require O(N2) multiplies and produce O(N log(N)) samples from an N sample image. When Gaussian low-pass filters are used, the result is a set of images which have been convolved with difference of Gaussian (DOG) filters from an exponential set of sizes. A fast computation technique based on ``resampling' is described and shown to reduce the DOLP transform complexity to O(N log(N)) multiplies and O(N) storage locations. A second technique, ``cascaded convolution with expansion,' is then defined and also shown to reduce the computational cost to O(N log(N)) multiplies. Combining these two techniques yields an algorithm for a DOLP transform that requires O(N) storage cells and requires O(N) multiplies. 相似文献
39.
40.
Structural descriptions and inexact matching 总被引:3,自引:0,他引:3