首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5745篇
  免费   842篇
  国内免费   652篇
电工技术   253篇
技术理论   1篇
综合类   718篇
化学工业   160篇
金属工艺   305篇
机械仪表   306篇
建筑科学   462篇
矿业工程   230篇
能源动力   80篇
轻工业   104篇
水利工程   120篇
石油天然气   114篇
武器工业   52篇
无线电   808篇
一般工业技术   500篇
冶金工业   125篇
原子能技术   38篇
自动化技术   2863篇
  2024年   37篇
  2023年   116篇
  2022年   226篇
  2021年   250篇
  2020年   225篇
  2019年   209篇
  2018年   189篇
  2017年   214篇
  2016年   212篇
  2015年   299篇
  2014年   390篇
  2013年   382篇
  2012年   410篇
  2011年   475篇
  2010年   422篇
  2009年   415篇
  2008年   432篇
  2007年   408篇
  2006年   359篇
  2005年   281篇
  2004年   242篇
  2003年   210篇
  2002年   148篇
  2001年   128篇
  2000年   124篇
  1999年   87篇
  1998年   79篇
  1997年   61篇
  1996年   38篇
  1995年   44篇
  1994年   26篇
  1993年   21篇
  1992年   17篇
  1991年   14篇
  1990年   16篇
  1989年   7篇
  1988年   9篇
  1987年   3篇
  1986年   3篇
  1985年   2篇
  1984年   1篇
  1983年   2篇
  1982年   1篇
  1980年   2篇
  1979年   1篇
  1976年   1篇
  1959年   1篇
排序方式: 共有7239条查询结果,搜索用时 18 毫秒
101.
针对胃上皮肿瘤细胞图像(以下简称肿瘤细胞图像)黏结严重和信息冗余的特点,提出了一种将自适应观测矩阵的压缩感知(SAM-CS)和自组织特征映射(SOFM)神经网络相结合的算法。该算法将肿瘤细胞图像拉成列向量,然后利用通过自适应过程产生的观测矩阵,基于压缩感知理论对图像信息进行观测,产生线性观测向量,最后利用SOFM神经网络的学习算法对观测向量进行训练和分类,实现对肿瘤细胞图像的识别。实验表明,相比常用算法,该算法至少提高了4.2%的识别准确率和5.7%的运算速度。  相似文献   
102.
A pair of gyradius ratios, defined from the principal radii of gyration, are used to generate a dimension map that describes the geometry of molecular aggregates in water and in organic solvents. Molecular dynamics simulations were performed on the aggregation of representative biomolecules and polyaromatic compounds to demonstrate application of the dimension map. It was shown that molecular aggregate data on the dimension map were bounded by two boundary curves, and that the map could be separated into three regions representing three groups of structures: one-dimensional rod-like structures; two-dimensional planar structures or short-cylinder-like structures; and three-dimensional sphere-like structures. Examining the location of the aggregates on the dimension map and how the location changes with solvent type and solute material parameter provides a simple yet effective way to infer the aggregation manner and to study solubility and mechanism of aggregation.  相似文献   
103.
The success of an artificial neural network (ANN) strongly depends on the variety of the connection weights and the network structure. Among many methods used in the literature to accurately select the network weights or structure in isolate; a few researchers have attempted to select both the weights and structure of ANN automatically by using metaheuristic algorithms. This paper proposes modified bat algorithm with a new solution representation for both optimizing the weights and structure of ANNs. The algorithm, which is based on the echolocation behaviour of bats, combines the advantages of population-based and local search algorithms. In this work, ability of the basic bat algorithm and some modified versions which are based on the consideration of the personal best solution in the velocity adjustment, the mean of personal best and global best solutions through velocity adjustment and the employment of three chaotic maps are investigated. These modifications are aimed to improve the exploration and exploitation capability of bat algorithm. Different versions of the proposed bat algorithm are incorporated to handle the selection of the structure as well as weights and biases of the ANN during the training process. We then use the Taguchi method to tune the parameters of the algorithm that demonstrates the best ability compared to the other versions. Six classifications and two time series benchmark datasets are used to test the performance of the proposed approach in terms of classification and prediction accuracy. Statistical tests demonstrate that the proposed method generates some of the best results in comparison with the latest methods in the literature. Finally, our best method is applied to a real-world problem, namely to predict the future values of rainfall data and the results show satisfactory of the method.  相似文献   
104.
Recent graphics processing units (GPUs), which have many processing units, can be used for general purpose parallel computation. To utilise the powerful computing ability, GPUs are widely used for general purpose processing. Since GPUs have very high memory bandwidth, the performance of GPUs greatly depends on memory access. The main contribution of this paper is to present a GPU implementation of computing Euclidean distance map (EDM) with efficient memory access. Given a two-dimensional (2D) binary image, EDM is a 2D array of the same size such that each element stores the Euclidean distance to the nearest black pixel. In the proposed GPU implementation, we have considered many programming issues of the GPU system such as coalesced access of global memory and shared memory bank conflicts, and so on. To be concrete, by transposing 2D arrays, which are temporal data stored in the global memory, with the shared memory, the main access from/to the global memory enables to be performed by coalesced access. In practice, we have implemented our parallel algorithm in the following three modern GPU systems: Tesla C1060, GTX 480 and GTX 580. The experimental results have shown that, for an input binary image with size of 9216 × 9216, our implementation can achieve a speedup factor of 54 over the sequential algorithm implementation.  相似文献   
105.
ABSTRACT

The recent trends in technology have made it possible to reproduce and share digital media more easily and more rapidly. This leads to the problem of exploiting the media illegitimately. To alleviate this problem, many cryptographic techniques are used to secure the data by encrypting them. However, the cloaked form of encrypted data attracts the intruder and shows the way to malicious attacks. Due to this, in recent times steganography has drawn more attention to secure the data. This article presents a new technique that embeds data in intermediate significant bit (ISB) and least significant bit (LSB) planes of the cover image. The method employs chaotic maps to generate random locations to hide the data bits as well as permutation order to encrypt the cover image. The cover image is first encrypted by applying permutation order, then embedding is carried out on the random locations generated. After embedding, the decrypted cover image is transmitted. This method provides two-level security in extracting the hidden data. Experimental outcomes (PSNR, MSE, NAE, and NCC) confirm that the method is proficient. The randomness of the values generated by chaotic maps is assessed by the NIST standard test suite.  相似文献   
106.
阐述了在ArcGis平台上利用数字地形图生产鄱阳湖湖区及五河七口DEM制作的方法.  相似文献   
107.
通过对光缆线路维护管理现状的分析,探讨了实现光缆线路维护管理信息化的技术和方法,对其中的SOA架构、RIA技术和地理信息系统的应用做了详细的论述.同时也对光缆线路维护管理信息系统设计与实现中的RFID设备信息自动读取方法、影像地图技术实现做了具体的描述。  相似文献   
108.
洪水风险图是一种融合了地理、社会经济信息、洪水特征等信息的专题地图,采用了Acrgis(地理信息系统)、SQL数据库等先进技术,可广泛应用于防洪减灾、洪水保险、各种发展规划、灾害评估等诸多方面.城市洪水风险图的绘制对预防城市外围洪水及降低城市内涝洪水影响、土地利用、城市发展规划等方面,起到重要的参考作用.该文以保定市为...  相似文献   
109.
基于欧几里得算法求乘法逆元的思想,提出了两种构造广义猫映射的简单方法。一种基于Fibonacci序列,一种基于Dirichlet序列;还给出了结合这两个序列的构造方法。仿真实验表明广义猫映射的变换周期是可变的并且相对于猫映射更大,从而有较好的置乱效果,这也使得它的安全性优于猫映射和Fibonacci等置乱变换。在图像信息隐蔽存储与传输中,这类图像变换具有重大的应用价值,为图像置乱提供了更坚实的理论基础。  相似文献   
110.
通过分析传统手机地图服务系统,设计与实现了导航手机地图服务系统。系统对地图数据进行有效组织,并通过记录与分析用户的交互操作对用户感兴趣对象进行归类,从而提供实时更新和自适应的手机地图。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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