全文获取类型
收费全文 | 18003篇 |
免费 | 2751篇 |
国内免费 | 1976篇 |
专业分类
电工技术 | 545篇 |
技术理论 | 3篇 |
综合类 | 1690篇 |
化学工业 | 1429篇 |
金属工艺 | 397篇 |
机械仪表 | 634篇 |
建筑科学 | 183篇 |
矿业工程 | 178篇 |
能源动力 | 603篇 |
轻工业 | 205篇 |
水利工程 | 54篇 |
石油天然气 | 132篇 |
武器工业 | 142篇 |
无线电 | 4317篇 |
一般工业技术 | 1330篇 |
冶金工业 | 271篇 |
原子能技术 | 59篇 |
自动化技术 | 10558篇 |
出版年
2024年 | 126篇 |
2023年 | 833篇 |
2022年 | 753篇 |
2021年 | 923篇 |
2020年 | 943篇 |
2019年 | 808篇 |
2018年 | 745篇 |
2017年 | 1299篇 |
2016年 | 1267篇 |
2015年 | 1136篇 |
2014年 | 1592篇 |
2013年 | 1376篇 |
2012年 | 1624篇 |
2011年 | 1522篇 |
2010年 | 1293篇 |
2009年 | 1451篇 |
2008年 | 994篇 |
2007年 | 1082篇 |
2006年 | 910篇 |
2005年 | 490篇 |
2004年 | 188篇 |
2003年 | 212篇 |
2002年 | 157篇 |
2001年 | 133篇 |
2000年 | 100篇 |
1999年 | 118篇 |
1998年 | 48篇 |
1997年 | 30篇 |
1996年 | 55篇 |
1995年 | 34篇 |
1994年 | 15篇 |
1993年 | 24篇 |
1992年 | 27篇 |
1991年 | 24篇 |
1990年 | 21篇 |
1989年 | 24篇 |
1988年 | 54篇 |
1987年 | 104篇 |
1986年 | 90篇 |
1985年 | 27篇 |
1984年 | 18篇 |
1983年 | 11篇 |
1982年 | 5篇 |
1981年 | 13篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 3篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1951年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
Dong-Wei Chen Jian-Qiang Sheng Jun-Jie Chen Chang-Dong Wang 《Neural computing & applications》2014,25(7-8):1809-1822
Recently, as one of the most popular exemplar-based clustering algorithms, affinity propagation has attracted a great amount of attention in various fields. The advantages of affinity propagation include the efficiency, insensitivity to cluster initialization and capability of finding clusters with less error. However, one shortcoming of the affinity propagation algorithm is that, the clustering results generated by affinity propagation strongly depend on the selection of exemplar preferences, which is a challenging model selection task. To tackle this problem, this paper investigates the clustering stability of affinity propagation for automatically selecting appropriate exemplar preferences. The basic idea is to define a novel stability measure for affinity propagation, based on which we can select exemplar preferences that generate the most stable clustering results. Consequently, the proposed approach is termed stability-based affinity propagation (SAP). Experimental results conducted on extensive real-world datasets have validated the effectiveness of the proposed SAP algorithm. 相似文献
62.
In this paper, a novel self-adaptive extreme learning machine (ELM) based on affinity propagation (AP) is proposed to optimize the radial basis function neural network (RBFNN). As is well known, the parameters of original ELM which developed by G.-B. Huang are randomly determined. However, that cannot objectively obtain a set of optimal parameters of RBFNN trained by ELM algorithm for different realistic datasets. The AP algorithm can automatically produce a set of clustering centers for the different datasets. According to the results of AP, we can, respectively, get the cluster number and the radius value of each cluster. In that case, the above cluster number and radius value can be used to initialize the number and widths of hidden layer neurons in RBFNN and that is also the parameters of coefficient matrix H of ELM. This may successfully avoid the subjectivity prior knowledge and randomness of training RBFNN. Experimental results show that the method proposed in this thesis has a more powerful generalization capability than conventional ELM for an RBFNN. 相似文献
63.
Chenping Hou Feiping Nie Hua Wang Dongyun Yi Changshui Zhang 《Neural computing & applications》2014,24(7-8):1555-1568
The recent years have witnessed a surge of interests of learning high-dimensional correspondence, which is important for both machine learning and neural computation community. Manifold learning–based researches have been considered as one of the most promising directions. In this paper, by analyzing traditional methods, we summarized a new framework for high-dimensional correspondence learning. Within this framework, we also presented a new approach, Local Approximation Maximum Variance Unfolding. Compared with other machine learning–based methods, it could achieve higher accuracy. Besides, we also introduce how to use the proposed framework and methods in a concrete application, cross-system personalization (CSP). Promising experimental results on image alignment and CSP applications are proposed for demonstration. 相似文献
64.
Twin support vector machine (TWSVM) is a research hot spot in the field of machine learning in recent years. Although its performance is better than traditional support vector machine (SVM), the kernel selection problem still affects the performance of TWSVM directly. Wavelet analysis has the characteristics of multivariate interpolation and sparse change, and it is suitable for the analysis of local signals and the detection of transient signals. The wavelet kernel function based on wavelet analysis can approximate any nonlinear functions. Based on the wavelet kernel features and the kernel function selection problem, wavelet twin support vector machine (WTWSVM) is proposed by this paper. It introduces the wavelet kernel function into TWSVM to make the combination of wavelet analysis techniques and TWSVM come true. The experimental results indicate that WTWSVM is feasible, and it improves the classification accuracy and generalization ability of TWSVM significantly. 相似文献
65.
《Journal of Process Control》2014,24(3):47-59
A nonlinear multiobjective model-predictive control (NMMPC) scheme, consisting of self-organizing radial basis function (SORBF) neural network prediction and multiobjective gradient optimization, is proposed for wastewater treatment process (WWTP) in this paper. The proposed NMMPC comprises a SORBF neural network identifier and a multiple objectives controller via the multi-gradient method (MGM). The SORBF neural network with concurrent structure and parameter learning is developed as a model identifier for approximating on-line the states of WWTP. Then, this NMMPC optimizes the multiple objectives under different operating functions, where all the objectives are minimized simultaneously. The solution of optimal control is based on the MGM which can shorten the solution time. Moreover, the stability and control performance of the closed-loop control system are well studied. Numerical simulations reveal that the proposed control strategy gives satisfactory tracking and disturbance rejection performance for WWTP. Experimental results show the efficacy of the proposed method. 相似文献
66.
《Expert systems with applications》2014,41(13):5780-5787
The massive quantity of data available today in the Internet has reached such a huge volume that it has become humanly unfeasible to efficiently sieve useful information from it. One solution to this problem is offered by using text summarization techniques. Text summarization, the process of automatically creating a shorter version of one or more text documents, is an important way of finding relevant information in large text libraries or in the Internet. This paper presents a multi-document summarization system that concisely extracts the main aspects of a set of documents, trying to avoid the typical problems of this type of summarization: information redundancy and diversity. Such a purpose is achieved through a new sentence clustering algorithm based on a graph model that makes use of statistic similarities and linguistic treatment. The DUC 2002 dataset was used to assess the performance of the proposed system, surpassing DUC competitors by a 50% margin of f-measure, in the best case. 相似文献
67.
《Expert systems with applications》2014,41(13):5788-5803
In this paper, an improved global-best harmony search algorithm, named IGHS, is proposed. In the IGHS algorithm, initialization based on opposition-based learning for improving the solution quality of the initial harmony memory, a new improvisation scheme based on differential evolution for enhancing the local search ability, a modified random consideration based on artificial bee colony algorithm for reducing randomness of the global-best harmony search (GHS) algorithm, as well as two perturbation schemes for avoiding premature convergence, are integrated. In addition, two parameters of IGHS, harmony memory consideration rate and pitch adjusting rate, are dynamically updated based on a composite function composed of a linear time-varying function, a periodic function and a sign function in view of approximate periodicity of evolution in nature. Experimental results tested on twenty-eight benchmark functions indicate that IGHS is far better than basic harmony search (HS) algorithm and GHS. In further study, IGHS has also been compared with other eight well known metaheuristics. The results show that IGHS is better than or at least similar to those approaches on most of test functions. 相似文献
68.
《Expert systems with applications》2014,41(7):3333-3342
Early and accurate diagnosis of Parkinson’s disease (PD) is important for early management, proper prognostication and for initiating neuroprotective therapies once they become available. Recent neuroimaging techniques such as dopaminergic imaging using single photon emission computed tomography (SPECT) with 123I-Ioflupane (DaTSCAN) have shown to detect even early stages of the disease. In this paper, we use the striatal binding ratio (SBR) values that are calculated from the 123I-Ioflupane SPECT scans (as obtained from the Parkinson’s progression markers initiative (PPMI) database) for developing automatic classification and prediction/prognostic models for early PD. We used support vector machine (SVM) and logistic regression in the model building process. We observe that the SVM classifier with RBF kernel produced a high accuracy of more than 96% in classifying subjects into early PD and healthy normal; and the logistic model for estimating the risk of PD also produced high degree of fitting with statistical significance indicating its usefulness in PD risk estimation. Hence, we infer that such models have the potential to aid the clinicians in the PD diagnostic process. 相似文献
69.
《Expert systems with applications》2014,41(14):6131-6137
Face recognition demonstrates the significant progress in the research field of biometric and computer vision. The fact is due to the current systems perform well under relatively control environments but tend to suffer when the present of variation in pose, illumination, and facial expression. In this work, a novel approach for face recognition called Symmetric Local Graph Structure (SLGS) is presented based on the Local Graph Structure (LGS). Each pixel is represented with a graph structure of its neighbours’ pixels. The histograms of the SLGS were used for recognition by using the nearest neighbour classifiers that include Euclidean distance, correlation coefficient and chi-square distance measures. AT&T and Yale face databases were used to be experimented with the proposed method. Extensive experiments on the face database clearly showed the superiority of the proposed approach over Local Binary Pattern (LBP) and LGS. The proposed SLGS is robust to variation in term of facial expressions, facial details, and illumination. Due to good performance of SLGS, it is expected that SLGS has a potential for application implementation in computer vision. 相似文献
70.