首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2134篇
  免费   74篇
  国内免费   76篇
电工技术   82篇
综合类   157篇
化学工业   200篇
金属工艺   92篇
机械仪表   185篇
建筑科学   214篇
矿业工程   122篇
能源动力   117篇
轻工业   63篇
水利工程   70篇
石油天然气   124篇
武器工业   72篇
无线电   110篇
一般工业技术   215篇
冶金工业   139篇
原子能技术   49篇
自动化技术   273篇
  2024年   2篇
  2023年   17篇
  2022年   37篇
  2021年   43篇
  2020年   42篇
  2019年   25篇
  2018年   27篇
  2017年   36篇
  2016年   45篇
  2015年   59篇
  2014年   105篇
  2013年   100篇
  2012年   113篇
  2011年   150篇
  2010年   94篇
  2009年   86篇
  2008年   114篇
  2007年   234篇
  2006年   142篇
  2005年   107篇
  2004年   117篇
  2003年   81篇
  2002年   67篇
  2001年   58篇
  2000年   58篇
  1999年   57篇
  1998年   30篇
  1997年   33篇
  1996年   25篇
  1995年   21篇
  1994年   18篇
  1993年   15篇
  1992年   5篇
  1991年   18篇
  1990年   35篇
  1989年   10篇
  1988年   8篇
  1987年   5篇
  1986年   9篇
  1985年   5篇
  1984年   4篇
  1979年   2篇
  1971年   2篇
  1970年   3篇
  1965年   2篇
  1962年   2篇
  1961年   2篇
  1960年   1篇
  1959年   3篇
  1957年   2篇
排序方式: 共有2284条查询结果,搜索用时 15 毫秒
951.
Mapping applications onto parallel platforms is a challenging problem, that becomes even more difficult when platforms are heterogeneous — nowadays a standard assumption. A high-level approach to parallel programming not only eases the application developer’s task, but it also provides additional information which can help realize an efficient mapping of the application.  相似文献   
952.
Hermite spectral methods using Sobolev orthogonal/biorthogonal basis functions for solving second and fourth-order differential equations on unbounded domains are proposed. Some Hermite–Sobolev orthogonal/biorthogonal basis functions are constructed which lead to the diagonalization of discrete systems. Accordingly, both the exact solutions and the approximate solutions can be represented as infinite and truncated Fourier series. The convergence is analyzed and some numerical results are presented to illustrate the effectiveness and the spectral accuracy of this approach.  相似文献   
953.
针对计算机超频结果测量值的估计问题,提出一种优化的LS-SVM回归模型解决方案;首先对CPU和显示卡超频的参数设置及主要结果进行了分析,并探讨了常用预测算法的不足,据此选择LS-SVM回归模型进行超频结果测量值的预测;然后设计了一种LCQPSO算法寻找模型参数的最优值,使模型的预测精度和泛化能力得以提高;经采集AMD FX-8350CPU的50组超频样本验证,该算法的预测误差比RBF神经网络降低了80%,表明了该算法的有效性。  相似文献   
954.
影响爆破效果的因素很多。作者将模糊数学应用于爆破效果的综合评价,提出了一种综合评价爆破效果的数学模型———模糊综合评价模型,并论述了采用该模型评价大型露天矿爆破效果的方法及实例。应用模糊评价模型可实现爆破效果综合评价的定量化。  相似文献   
955.
《工程爆破》2022,(4):13-15
利用LS-DYNA对水下钻孔爆破岩石破碎过程进行了数值模拟,根据不同厚度水层覆盖条件下的爆破物理图像,结合岩石内3个单元的应力变化时程曲线,对起爆后10ms内岩石中的应力变化进行了分析;并根据岩石中裂隙的形成和发展情况,对爆破动载作用下水下岩石的破坏情况进行了相应的理论分析。模拟结果可应用于水下钻孔爆破的参数设计。  相似文献   
956.
依据对《全自动封闭型发光免疫分析仪校准规范》中的标准物质选取甲胎蛋白(AFP)血清(液体)标准物质,并对其测量不确定度进行了评定,建立了测量模型,考察分析不确定度的主要来源,计算出合成标准不确定度和扩展不确定度。  相似文献   
957.
传统伪相关反馈容易产生“查询主题漂移”,有效避免“查询主题漂移”的首要前提是确定高质量的相关文档,形成与用户查询需求相关的伪相关文档集合.在检索结果聚类的基础上,研究了XML伪相关文档查找方法,在充分考虑XML内容和结构特征的前提下,提出了基于均衡化权值的簇标签提取方法,并以此为基础,提出了候选簇的排序模型和基于候选簇的文档排序模型.相关实验数据表明,与初始检索结果相比,排序模型获得了较好的性能,有效地查找到了更多的XML伪相关文档.  相似文献   
958.
《遥感技术与应用》2013,28(5):766-772
The glacier is an important natural and great potential of the fresh water resources,and plays a vital role in the regional ecological environment balance and stability.This study acquired the airborne hyperspectral data over Zhongxi-1 Glacier in August,2011.Firstly,the data preprocessing,including radiation calibration,atmospheric correction and geometric correction was performed on the hyperspectral data;secondly,using principal component analysis (PCA)and minimum noise transformation (MNF) for data dimensionality reduced respectively;thirdly,six classification methods,i.e.maximum likelihood method,minimum distance,Mahalanobis distance method,spectral angle method binary encoding,and spectral information divergence,were applied in the two datasets,and also the comparison results of the different classification methods were conducted to determine the optimal method of data dimensionality reduction and the optimal classification method;finally,the hyperspectral data for glacierclassification was compared with the HJ satellite multispectral data.The results show that: the classification accuracy of the PCA transform data from hyperspectral data is higher than that of MNF transform data;for the PCA transformed dataset of hyperspectraldata,the Mahalanobis distance method,maximum likelihood method,minimum distance method produced better classification results with the comparison to others,while for the MNF transformed dataset from hyperspectral data,the spectral angle method and spectral information divergence method is better than others.  相似文献   
959.
A well-known result due to J.T. Stafford asserts that a stably free left module M over the Weyl algebras D=An(k) or Bn(k)–where k is a field of characteristic 0–with is free. The purpose of this paper is to present a new constructive proof of this result as well as an effective algorithm for the computation of bases of M. This algorithm, based on the new constructive proofs [Hillebrand, A., Schmale, W., 2001. Towards an effective version of a theorem of Stafford. J. Symbolic Comput. 32, 699–716; Leykin, A., 2004. Algorithmic proofs of two theorems of Stafford. J. Symbolic Comput. 38, 1535–1550] of J.T. Stafford’s result on the number of generators of left ideals of D, performs Gaussian elimination on the formal adjoint of the presentation matrix of M. We show that J.T. Stafford’s result is a particular case of a more general one asserting that a stably free left D-module M with is free, where denotes the stable rank of a ring D. This result is constructive if the stability of unimodular vectors with entries in D can be tested. Finally, an algorithm which computes the left projective dimension of a general left D-module M defined by means of a finite free resolution is presented. It allows us to check whether or not the left D-module M is stably free.  相似文献   
960.
Software testing is an essential process in software development. Software testing is very costly, often consuming half the financial resources assigned to a project. The most laborious part of software testing is the generation of test-data. Currently, this process is principally a manual process. Hence, the automation of test-data generation can significantly cut the total cost of software testing and the software development cycle in general. A number of automated test-data generation approaches have already been explored. This paper highlights the goal-oriented approach as a promising approach to devise automated test-data generators. A range of optimization techniques can be used within these goal-oriented test-data generators, and their respective characteristics, when applied to these situations remain relatively unexplored. Therefore, in this paper, a comparative study about the effectiveness of the most commonly used optimization techniques is conducted.
James Miller (Corresponding author)Email:

Man Xiao   received a B.S. degree in Space Physics and Electronics Information Engineering from the University of Wuhan, China; and a M.S. degree in Software Engineering, from the University of Alberta, Canada. She is now a Software Engineer at a small start-up company in Edmonton, Alberta, Canada. Mohamed El-Attar   is a Ph.D. candidate (Software Engineering) at the University of Alberta and a member of the STEAM laboratory. His research interests include Requirements Engineering, in particular with UML and use cases, object-oriented analysis and design, model transformation and empirical studies. Mohamed received a B.S. Engineering in Computer Systems from Carleton University. Marek Reformat   received his M.S. degree from the Technical University of Poznan, Poland, and his Ph.D. from the University of Manitoba, Canada. His interests are related to simulation and modeling in time-domain, and evolutionary computing and its application to optimization problems. For 3 years he worked for the Manitoba HVDC Research Centre, Canada where he was a member of a simulation software development team. Currently, he is with the Department of Electrical and Computer Engineering at the University of Alberta. His research interests lay in the areas of application of Computational Intelligence techniques, such as neuro-fuzzy systems and evolutionary computing, and probabilistic and evidence theories to intelligent data analysis leading to translating data into knowledge. He applies these methods to conduct research in the areas of Software Engineering, Software Quality in particular, and Knowledge Engineering. He was a member of program committees of several conferences related to computational intelligence and evolutionary computing. James Miller   received his B.S. and Ph.D. degrees in Computer Science from the University of Strathclyde, Scotland. During this period, he worked on the ESPRIT project GENEDIS on the production of a real-time stereovision system. Subsequently, he worked at the United Kingdom’s National Electronic Research Initiative on Pattern Recognition as a Principal Scientist, before returning to the University of Strathclyde to accept a lectureship and subsequently a senior lectureship in Computer Science. Initially, during this period, his research interests were in computer vision, and he was a co-investigator on the ESPRIT 2 project VIDIMUS. Since 1993, his research interests were in software and systems engineering. In 2000, he joined the Department of Electronic and Computer Engineering at the University of Alberta as a full professor and in 2003 became an adjunct professor at the Department of Electrical and Computer Engineering at the University of Calgary. He is the principal investigator in a number of research projects that investigate verification and validation issues of software, embedded and ubiquitous computer systems. He has published over one hundred refereed journal and conference papers on software and systems engineering (see for details for recent directions); and currently serves on the program committee for the IEEE International Symposium on Empirical Software Engineering and Measurement; and sits on the editorial board of the Journal of Empirical Software Engineering.   相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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