首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2803篇
  免费   60篇
  国内免费   10篇
电工技术   44篇
综合类   2篇
化学工业   397篇
金属工艺   82篇
机械仪表   167篇
建筑科学   56篇
矿业工程   3篇
能源动力   109篇
轻工业   81篇
水利工程   26篇
石油天然气   8篇
无线电   510篇
一般工业技术   482篇
冶金工业   366篇
原子能技术   18篇
自动化技术   522篇
  2023年   26篇
  2022年   58篇
  2021年   57篇
  2020年   49篇
  2019年   52篇
  2018年   64篇
  2017年   56篇
  2016年   81篇
  2015年   54篇
  2014年   65篇
  2013年   171篇
  2012年   88篇
  2011年   128篇
  2010年   106篇
  2009年   98篇
  2008年   101篇
  2007年   96篇
  2006年   89篇
  2005年   78篇
  2004年   59篇
  2003年   57篇
  2002年   66篇
  2001年   55篇
  2000年   63篇
  1999年   58篇
  1998年   118篇
  1997年   82篇
  1996年   85篇
  1995年   50篇
  1994年   49篇
  1993年   45篇
  1992年   46篇
  1991年   35篇
  1990年   40篇
  1989年   39篇
  1988年   32篇
  1987年   30篇
  1986年   27篇
  1985年   35篇
  1984年   22篇
  1983年   32篇
  1982年   27篇
  1981年   29篇
  1980年   29篇
  1979年   34篇
  1978年   17篇
  1977年   17篇
  1976年   22篇
  1975年   11篇
  1973年   11篇
排序方式: 共有2873条查询结果,搜索用时 15 毫秒
71.
The oxidation kinetics of CuFeO2 in the Cu-Fe-O system have been studied between 500 and 900° C in an atmosphere containing 1 vol% oxygen in a nitrogen stream using thermogravimetric analysis (TGA). It was found that addition of Fe2O3 to the CuFeO2 caused a decrease in the oxidation rate while addition of CuO caused an increase. On increasing the concentration of Fe2O3 the activation energy was found to increase from ~ 18 kcal mol–1 to ~ 45 kcal mol–1 and the exponent n in Avrami's equationf=1-exp (–kt n) was also observed to increase, from 1.3 to 2.3. On adding CuO to the CuFeO2 in the Cu-Fe-O system the activation energy decreased from ~ 18 kcal mol–1 to ~ 8 kcal mol–1. The variation in both values indicates changes in the oxidation mechanisms. The microstructural changes associated with oxidation have been studied using optical microscopy. A model has been proposed to explain the results.  相似文献   
72.
A clustering performance measure based on fuzzy set decomposition   总被引:4,自引:0,他引:4  
Clustering is primarily used to uncover the true underlying structure of a given data set and, for this purpose, it is desirable to subject the same data to several different clustering algorithms. This paper attempts to put an order on the various partitions of a data set obtained from different clustering algorithms. The goodness of each partition is expressed by means of a performance measure based on a fuzzy set decomposition of the data set under consideration. Several experiments reported in here show that the proposed performance measure puts an order on different partitions of the same data which is consistent with the error rate of a classifier designed on the basis of the obtained cluster labelings.  相似文献   
73.
Evaluation of projection algorithms   总被引:1,自引:0,他引:1  
A number of linear and nonlinear mapping algorithms for the projection of patterns from a high-dimensional space to two dimensions are available. These two-dimensional representations allow quick visual observation of a data set. A combination of two popular mapping algorithms-Sammon's mean-square error technique and the triangulation method-is proposed to overcome the limitations in the individual algorithms. Some factors which describe the goodness of a projection are described, and a comparison is made of six of these algorithms by running them on four data sets. The results obtained support the use of the proposed algorithm.  相似文献   
74.
Quadtrees are compact hierarchical representations of images. In this paper, we define the efficiency of quadtrees in representing image segments and derive the relationship between the size of the enclosing rectangle of an image segment and its optimal quadtree. We show that if an image segment has an enclosing rectangle having sides of lengths x and y, such that 2N-1 × max (x, y) ? 2N, then the optimal quadtree may be the one representing an image of size 2N × 2N or 2N+1 × 2N+1. It is shown that in some situations the quadtree corresponding to the larger image has fewer nodes. Also, some necessary conditions are derived to identify segments for which the larger image size results in a quadtree which is no more expensive than the quadtree for the smaller image size.  相似文献   
75.
Application of graph theory to reliability analysis was first made in 1970 [1]. Over the years, a large number of computer programmes have been developed to determine the spanning trees, the minimal paths and cutsets, which are essential for determining the reliability of the network. In recent years, there has been an interest 2., 4. in developing small desk top calculators for specific purposes, which could be used by the designers of transportation systems, communication systems, etc. In this article the authors present an approach to design a microprocessor based equipment to determine minimal pathset and minimal cutset from the incidence matrix of the graph. The authors have presented a new design approach, based on search technique. The salient feature of the new approach is a novel tracing process in which the desired graph is traced by operating a set of constraints. The new design approach has already been used by the authors to develop a microprocessor based spanning tree generator 2., 3..  相似文献   
76.
An intrinsic dimensionality estimator from near-neighbor information   总被引:3,自引:0,他引:3  
The intrinsic dimensionality of a set of patterns is important in determining an appropriate number of features for representing the data and whether a reasonable two- or three-dimensional representation of the data exists. We propose an intuitively appealing, noniterative estimator for intrinsic dimensionality which is based on nearneighbor information. We give plausible arguments supporting the consistency of this estimator. The method works well in identifying the true dimensionality for a variety of artificial data sets and is fairly insensitive to the number of samples and to the algorithmic parameters. Comparisons between this new method and the global eigenvalue approach demonstrate the utility of our estimator.  相似文献   
77.
Chemical method has been used to prepare cadmium sulphide by using cadmium, hydrochloric acid and H2S. The reflection spectra of covered and uncovered sintered films of CdS have been recorded by ‘Hitachi spectrophotometer’ over the wavelength range 300–700 nm. The energy band gaps of these films have been calculated from reflection spectra. It is found that the energy band gap of both films is same as 2.41 eV. It is indicated that energy band gap of these films does not change. This value of band gap is in good agreement with the value reported by other workers. The measurement of photocurrent has also been carried out using Keithley High Resistance meter/ Electrometer. This film shows the high photosensitivity and high photocurrent decay. Thus so obtained films are suitable for fabrication of photo detectors and solar cells.  相似文献   
78.
79.
This paper describes an integrated starter generator (ISG) for automobile applications with 42-V powernet. This system is based on an induction machine which is directly mounted on the engine crankshaft and controlled using the technique of direct torque control (DTC). The suitability of the technique for ISG application is explained. The control structure of DTC for ISG application is described. Detailed experimental results from a 1.4-1 diesel engine are presented demonstrating the performance of the system during cranking as well as generation. The ISG also incorporates the feature of "on the fly start" during generation mode. Details of a low voltage high current power converter developed for this application are also given.  相似文献   
80.
Generating discriminating cartoon faces using interacting snakes   总被引:1,自引:0,他引:1  
As a computational bridge between the high-level a priori knowledge of object shape and the low-level image data, active contours (or snakes) are useful models for the extraction of deformable objects. We propose an approach for manipulating multiple snakes iteratively, called interacting snakes, that minimizes the attraction energy functionals on both contours and enclosed regions of individual snakes and the repulsion energy functionals among multiple snakes that interact with each other. We implement the interacting snakes through explicit curve (parametric active contours) representation in the domain of face recognition. We represent human faces semantically via facial components such as eyes, mouth, face outline, and the hair outline. Each facial component is encoded by a closed (or open) snake that is drawn from a 3D generic face model. A collection of semantic facial components form a hypergraph, called semantic face graph, which employs interacting snakes to align the general facial topology onto the sensed face images. Experimental results show that a successful interaction among multiple snakes associated with facial components makes the semantic face graph a useful model for face representation, including cartoon faces and caricatures, and recognition.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号