全文获取类型
收费全文 | 44384篇 |
免费 | 3805篇 |
国内免费 | 2577篇 |
专业分类
电工技术 | 3509篇 |
技术理论 | 1篇 |
综合类 | 3950篇 |
化学工业 | 2310篇 |
金属工艺 | 5117篇 |
机械仪表 | 9504篇 |
建筑科学 | 1124篇 |
矿业工程 | 2188篇 |
能源动力 | 855篇 |
轻工业 | 3296篇 |
水利工程 | 381篇 |
石油天然气 | 635篇 |
武器工业 | 355篇 |
无线电 | 2609篇 |
一般工业技术 | 3060篇 |
冶金工业 | 1838篇 |
原子能技术 | 94篇 |
自动化技术 | 9940篇 |
出版年
2024年 | 247篇 |
2023年 | 816篇 |
2022年 | 1437篇 |
2021年 | 1547篇 |
2020年 | 1612篇 |
2019年 | 1156篇 |
2018年 | 1060篇 |
2017年 | 1376篇 |
2016年 | 1510篇 |
2015年 | 1695篇 |
2014年 | 2797篇 |
2013年 | 2329篇 |
2012年 | 3346篇 |
2011年 | 3475篇 |
2010年 | 2470篇 |
2009年 | 2471篇 |
2008年 | 2217篇 |
2007年 | 3021篇 |
2006年 | 2854篇 |
2005年 | 2413篇 |
2004年 | 1933篇 |
2003年 | 1713篇 |
2002年 | 1462篇 |
2001年 | 1210篇 |
2000年 | 997篇 |
1999年 | 784篇 |
1998年 | 564篇 |
1997年 | 464篇 |
1996年 | 356篇 |
1995年 | 326篇 |
1994年 | 258篇 |
1993年 | 193篇 |
1992年 | 128篇 |
1991年 | 98篇 |
1990年 | 93篇 |
1989年 | 89篇 |
1988年 | 72篇 |
1987年 | 29篇 |
1986年 | 31篇 |
1985年 | 18篇 |
1984年 | 11篇 |
1983年 | 16篇 |
1982年 | 13篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1979年 | 7篇 |
1978年 | 5篇 |
1976年 | 4篇 |
1959年 | 4篇 |
1957年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
We consider a single machine scheduling problem with resource dependent release times that can be controlled by a non-increasing convex resource consumption function. The objective is to minimize the weighted total resource consumption and sum of job completion times with an initial release time greater than the total processing times. It is known that the problem is polynomially solvable in O(n4) with n the number of jobs. 相似文献
992.
We present a single-machine problem with the unequal release times under learning effect and deteriorating jobs when the objective is minimizing the makespan. In this study, we introduced a scheduling model with unequal release times in which both job deterioration and learning exist simultaneously. By the effects of learning and deterioration, we mean that the processing time of a job is defined by increasing function of its execution start time and position in the sequence. A branch-and-bound algorithm incorporating with several dominance properties and lower bounds is developed to derive the optimal solution. A heuristic algorithm is proposed to obtain a near-optimal solution. The computational experiments show that the branch-and-bound algorithm can solve instances up to 30 jobs, and the average error percentage of the proposed heuristic is less than 0.16%. 相似文献
993.
This paper studies a generalization of the order acceptance and scheduling problem in a single-machine environment where a pool consisting of firm planned orders as well as potential orders is available from which an over-demanded company can select. The capacity available for processing the accepted orders is limited and each order is characterized by a known processing time, delivery date, revenue and a weight representing a penalty per unit-time delay beyond the delivery date. We prove that the existence of a constant-factor approximation algorithm for this problem is unlikely. We propose two linear formulations that are solved using an IP solver and we devise two exact branch-and-bound procedures able to solve instances with up to 50 jobs within reasonable CPU times. We compare the efficiency and quality of the results obtained using the different solution approaches. 相似文献
994.
The application of cryogenics in manufacturing has previously received significant attention in supporting manufacturing processes. This paper explores the continued application of cryogenic manufacturing for producing personalised products. This paper presents the novel concept of cryogenic CNC machining of elastomers and the development of a process control system for cryogenic CNC machining. The control process is illustrated alongside material dependent machining data and example soft elastomer machined parts. An enhancement to the process is also detailed within a closed loop thermally monitored cryogenic CNC machining facility. 相似文献
995.
Feature selection for text categorization is a well-studied problem and its goal is to improve the effectiveness of categorization, or the efficiency of computation, or both. The system of text categorization based on traditional term-matching is used to represent the vector space model as a document; however, it needs a high dimensional space to represent the document, and does not take into account the semantic relationship between terms, which leads to a poor categorization accuracy. The latent semantic indexing method can overcome this problem by using statistically derived conceptual indices to replace the individual terms. With the purpose of improving the accuracy and efficiency of categorization, in this paper we propose a two-stage feature selection method. Firstly, we apply a novel feature selection method to reduce the dimension of terms; and then we construct a new semantic space, between terms, based on the latent semantic indexing method. Through some applications involving the spam database categorization, we find that our two-stage feature selection method performs better. 相似文献
996.
MELM-GRBF: A modified version of the extreme learning machine for generalized radial basis function neural networks 总被引:3,自引:0,他引:3
Francisco Fernández-NavarroAuthor Vitae César Hervás-MartínezAuthor VitaeJavier Sanchez-MonederoAuthor Vitae Pedro Antonio GutiérrezAuthor Vitae 《Neurocomputing》2011,74(16):2502-2510
In this paper, we propose a methodology for training a new model of artificial neural network called the generalized radial basis function (GRBF) neural network. This model is based on generalized Gaussian distribution, which parametrizes the Gaussian distribution by adding a new parameter τ. The generalized radial basis function allows different radial basis functions to be represented by updating the new parameter τ. For example, when GRBF takes a value of τ=2, it represents the standard Gaussian radial basis function. The model parameters are optimized through a modified version of the extreme learning machine (ELM) algorithm. In the methodology proposed (MELM-GRBF), the centers of each GRBF were taken randomly from the patterns of the training set and the radius and τ values were determined analytically, taking into account that the model must fulfil two constraints: locality and coverage. An thorough experimental study is presented to test its overall performance. Fifteen datasets were considered, including binary and multi-class problems, all of them taken from the UCI repository. The MELM-GRBF was compared to ELM with sigmoidal, hard-limit, triangular basis and radial basis functions in the hidden layer and to the ELM-RBF methodology proposed by Huang et al. (2004) [1]. The MELM-GRBF obtained better results in accuracy than the corresponding sigmoidal, hard-limit, triangular basis and radial basis functions for almost all datasets, producing the highest mean accuracy rank when compared with these other basis functions for all datasets. 相似文献
997.
Rolling element bearing fault diagnosis using wavelet transform 总被引:2,自引:0,他引:2
P.K. Kankar Author VitaeSatish C. Sharma Author Vitae S.P. HarshaAuthor Vitae 《Neurocomputing》2011,74(10):1638-1645
This paper is focused on fault diagnosis of ball bearings having localized defects (spalls) on the various bearing components using wavelet-based feature extraction. The statistical features required for the training and testing of artificial intelligence techniques are calculated by the implementation of a wavelet based methodology developed using Minimum Shannon Entropy Criterion. Seven different base wavelets are considered for the study and Complex Morlet wavelet is selected based on minimum Shannon Entropy Criterion to extract statistical features from wavelet coefficients of raw vibration signals. In the methodology, firstly a wavelet theory based feature extraction methodology is developed that demonstrates the information of fault from the raw signals and then the potential of various artificial intelligence techniques to predict the type of defect in bearings is investigated. Three artificial intelligence techniques are used for faults classifications, out of which two are supervised machine learning techniques i.e. support vector machine, learning vector quantization and other one is an unsupervised machine learning technique i.e. self-organizing maps. The fault classification results show that the support vector machine identified the fault categories of rolling element bearing more accurately and has a better diagnosis performance as compared to the learning vector quantization and self-organizing maps. 相似文献
998.
John Shawe-TaylorAuthor VitaeShiliang SunAuthor Vitae 《Neurocomputing》2011,74(17):3609-3618
Support vector machines (SVMs) are theoretically well-justified machine learning techniques, which have also been successfully applied to many real-world domains. The use of optimization methodologies plays a central role in finding solutions of SVMs. This paper reviews representative and state-of-the-art techniques for optimizing the training of SVMs, especially SVMs for classification. The objective of this paper is to provide readers an overview of the basic elements and recent advances for training SVMs and enable them to develop and implement new optimization strategies for SVM-related research at their disposal. 相似文献
999.
Face recognition based on extreme learning machine 总被引:2,自引:0,他引:2
Weiwei ZongAuthor VitaeGuang-Bin HuangAuthor Vitae 《Neurocomputing》2011,74(16):2541-2551
Extreme learning machine (ELM) is an efficient learning algorithm for generalized single hidden layer feedforward networks (SLFNs), which performs well in both regression and classification applications. It has recently been shown that from the optimization point of view ELM and support vector machine (SVM) are equivalent but ELM has less stringent optimization constraints. Due to the mild optimization constraints ELM can be easy of implementation and usually obtains better generalization performance. In this paper we study the performance of the one-against-all (OAA) and one-against-one (OAO) ELM for classification in multi-label face recognition applications. The performance is verified through four benchmarking face image data sets. 相似文献
1000.
Junfa LiuAuthor Vitae Yiqiang ChenAuthor VitaeMingjie LiuAuthor Vitae Zhongtang ZhaoAuthor Vitae 《Neurocomputing》2011,74(16):2566-2572
Indoor location estimation based on Wi-Fi has attracted more and more attention from both research and industry fields. It brings two significant challenges. One is requiring a vast amount of labeled calibration data. The other is real-time training and testing for location estimation task. Traditional machine learning methods cannot get high performance in both aspects. This paper proposed a novel semi-supervised learning method SELM (semi-supervised extreme learning machine) and applied it to sparse calibrated location estimation. There are two advantages of the proposed SELM. First, it employs graph Laplacian regularization to import large number of unlabeled samples which can dramatically reduce labeled calibration samples. Second, it inherits the good property of ELM on extreme training and testing speed. Comparative experiments show that with same number of labeled samples, our method outperforms original ELM and back propagation (BP) network, especially in the case that the calibration data is very sparse. 相似文献