首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   9290篇
  免费   510篇
  国内免费   66篇
电工技术   255篇
综合类   31篇
化学工业   1948篇
金属工艺   204篇
机械仪表   241篇
建筑科学   316篇
矿业工程   12篇
能源动力   617篇
轻工业   989篇
水利工程   119篇
石油天然气   207篇
武器工业   6篇
无线电   1119篇
一般工业技术   1642篇
冶金工业   561篇
原子能技术   82篇
自动化技术   1517篇
  2023年   198篇
  2022年   406篇
  2021年   632篇
  2020年   478篇
  2019年   484篇
  2018年   612篇
  2017年   437篇
  2016年   502篇
  2015年   301篇
  2014年   456篇
  2013年   755篇
  2012年   518篇
  2011年   541篇
  2010年   365篇
  2009年   307篇
  2008年   270篇
  2007年   250篇
  2006年   207篇
  2005年   180篇
  2004年   144篇
  2003年   111篇
  2002年   128篇
  2001年   72篇
  2000年   79篇
  1999年   94篇
  1998年   164篇
  1997年   133篇
  1996年   83篇
  1995年   97篇
  1994年   62篇
  1993年   60篇
  1992年   46篇
  1991年   29篇
  1990年   33篇
  1989年   55篇
  1988年   54篇
  1987年   32篇
  1986年   34篇
  1985年   53篇
  1984年   51篇
  1983年   43篇
  1982年   32篇
  1981年   25篇
  1980年   33篇
  1979年   23篇
  1978年   19篇
  1977年   22篇
  1976年   34篇
  1975年   17篇
  1973年   18篇
排序方式: 共有9866条查询结果,搜索用时 296 毫秒
61.
In this article, a new extension of affine arithmetic is introduced. This technique is based on a quadratic form named general quadratic form. We focus here on the computation of reliable bounds of a function over a hypercube by using this new tool. Some properties of first quadratic functions and then polynomial ones are reported. In order to show the efficiency of such a method, ten polynomial global optimization problems are presented and solved by using an interval branch-and-bound based algorithm. The work of the first author was also supported by the Laboratoire de Mathématiques Appliquées CNRS–FRE 2570, Université de Pau et des Pays de l'Adour, France, and by the Laboratoire d'Electrotechnique et d'Electronique Industrielle CNRS–UMR5828, Group EM3, INPT–ENSEEIHT.  相似文献   
62.
Tree-based partitioning of date for association rule mining   总被引:1,自引:1,他引:0  
The most computationally demanding aspect of Association Rule Mining is the identification and counting of support of the frequent sets of items that occur together sufficiently often to be the basis of potentially interesting rules. The task increases in difficulty with the scale of the data and also with its density. The greatest challenge is posed by data that is too large to be contained in primary memory, especially when high data density and/or low support thresholds give rise to very large numbers of candidates that must be counted. In this paper, we consider strategies for partitioning the data to deal effectively with such cases. We describe a partitioning approach which organises the data into tree structures that can be processed independently. We present experimental results that show the method scales well for increasing dimensions of data and performs significantly better than alternatives, especially when dealing with dense data and low support thresholds. Shakil Ahmed received a first class BSc (Hons) degree from Dhaka University, Bangladesh, in 1990; and an MSc (first class), also Dhaka University, in 1992. He received his PhD from The University of Liverpool, UK, in 2005. From 2000 onwards he is a member of the Data Mining Group at the Department of Computer Science of the University of Liverpool, UK. His research interests include data mining, Association Rule Mining and pattern recognition. Frans Coenen has been working in the field of Data Mining for many years and has written widely on the subject. He received his PhD from Liverpool Polytechnic in 1989, after which he took up a post as a RA within the Department of Computer Science at the University of Liverpool. In 1997, he took up a lecturing post within the same department. His current Data Mining research interests include Association rule Mining, Classification algorithms and text mining. He is on the programme committee for ICDM'05 and was the chair for the UK KDD symposium (UKKDD'05). Paul Leng is professor of e-Learning at the University of Liverpool and director of the e-Learning Unit, which is responsible for overseeing the University's online degree programmes, leading to degrees of MSc in IT and MBA. Along with e-Learning, his main research interests are in Data Mining, especially in methods of discovering Association Rules. In collaboration with Frans Coenen, he has developed efficient new algorithms for finding frequent sets and is exploring applications in text mining and classification.  相似文献   
63.
Geologists interpret seismic data to understand subsurface properties and subsequently to locate underground hydrocarbon resources. Channels are among the most important geological features interpreters analyze to locate petroleum reservoirs. However, manual channel picking is both time consuming and tedious. Moreover, similar to any other process dependent on human intervention, manual channel picking is error prone and inconsistent. To address these issues, automatic channel detection is both necessary and important for efficient and accurate seismic interpretation. Modern systems make use of real-time image processing techniques for different tasks. Automatic channel detection is a combination of different mathematical methods in digital image processing that can identify streaks within the images called channels that are important to the oil companies. In this paper, we propose an innovative automatic channel detection algorithm based on machine learning techniques. The new algorithm can identify channels in seismic data/images fully automatically and tremendously increases the efficiency and accuracy of the interpretation process. The algorithm uses deep neural network to train the classifier with both the channel and non-channel patches. We provide a field data example to demonstrate the performance of the new algorithm. The training phase gave a maximum accuracy of 84.6% for the classifier and it performed even better in the testing phase, giving a maximum accuracy of 90%.  相似文献   
64.
The bivariate distributions are useful in simultaneous modeling of two random variables. These distributions provide a way to model models. The bivariate families of distributions are not much widely explored and in this article a new family of bivariate distributions is proposed. The new family will extend the univariate transmuted family of distributions and will be helpful in modeling complex joint phenomenon. Statistical properties of the new family of distributions are explored which include marginal and conditional distributions, conditional moments, product and ratio moments, bivariate reliability and bivariate hazard rate functions. The maximum likelihood estimation (MLE) for parameters of the family is also carried out. The proposed bivariate family of distributions is studied for the Weibull baseline distributions giving rise to bivariate transmuted Weibull (BTW) distribution. The new bivariate transmuted Weibull distribution is explored in detail. Statistical properties of the new BTW distribution are studied which include the marginal and conditional distributions, product, ratio and conditional momenst. The hazard rate function of the BTW distribution is obtained. Parameter estimation of the BTW distribution is also done. Finally, real data application of the BTW distribution is given. It is observed that the proposed BTW distribution is a suitable fit for the data used.  相似文献   
65.
The Journal of Supercomputing - Agile software development (ASD) and software product line (SPL) have shown significant benefits for software engineering processes and practices. Although both...  相似文献   
66.
The Journal of Supercomputing - The Internet of Things is a rapidly evolving technology in which interconnected computing devices and sensors share data over the network to decipher different...  相似文献   
67.
Neural Computing and Applications - In order to provide benchmark performance for Urdu text document classification, the contribution of this paper is manifold. First, it provides a publicly...  相似文献   
68.
Neural Computing and Applications - Preserving red-chili quality is of utmost importance in which the authorities demand quality techniques to detect, classify, and prevent it from impurities. For...  相似文献   
69.
Neural Computing and Applications - Emperor Penguin Optimizer (EPO) is a recently developed metaheuristic algorithm to solve general optimization problems. The main strength of EPO is twofold....  相似文献   
70.
Neural Computing and Applications - This paper investigates the ability of deep neural networks (DNNs) to improve the automatic recognition of dysarthric speech through the use of convolutional...  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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