全文获取类型
收费全文 | 22572篇 |
免费 | 3958篇 |
国内免费 | 3181篇 |
专业分类
电工技术 | 1453篇 |
技术理论 | 3篇 |
综合类 | 2209篇 |
化学工业 | 730篇 |
金属工艺 | 240篇 |
机械仪表 | 896篇 |
建筑科学 | 1071篇 |
矿业工程 | 756篇 |
能源动力 | 279篇 |
轻工业 | 658篇 |
水利工程 | 411篇 |
石油天然气 | 590篇 |
武器工业 | 200篇 |
无线电 | 2713篇 |
一般工业技术 | 1556篇 |
冶金工业 | 704篇 |
原子能技术 | 81篇 |
自动化技术 | 15161篇 |
出版年
2024年 | 215篇 |
2023年 | 592篇 |
2022年 | 1008篇 |
2021年 | 1151篇 |
2020年 | 1122篇 |
2019年 | 932篇 |
2018年 | 905篇 |
2017年 | 1071篇 |
2016年 | 1063篇 |
2015年 | 1246篇 |
2014年 | 1622篇 |
2013年 | 1659篇 |
2012年 | 1777篇 |
2011年 | 1923篇 |
2010年 | 1467篇 |
2009年 | 1513篇 |
2008年 | 1575篇 |
2007年 | 1647篇 |
2006年 | 1301篇 |
2005年 | 1064篇 |
2004年 | 875篇 |
2003年 | 714篇 |
2002年 | 642篇 |
2001年 | 481篇 |
2000年 | 402篇 |
1999年 | 308篇 |
1998年 | 232篇 |
1997年 | 187篇 |
1996年 | 167篇 |
1995年 | 142篇 |
1994年 | 119篇 |
1993年 | 88篇 |
1992年 | 59篇 |
1991年 | 50篇 |
1990年 | 44篇 |
1989年 | 43篇 |
1988年 | 28篇 |
1987年 | 22篇 |
1986年 | 26篇 |
1985年 | 26篇 |
1984年 | 20篇 |
1983年 | 31篇 |
1982年 | 24篇 |
1981年 | 24篇 |
1980年 | 21篇 |
1979年 | 13篇 |
1978年 | 15篇 |
1977年 | 10篇 |
1976年 | 7篇 |
1975年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
Traditionally, in supervised machine learning, (a significant) part of the available data (usually 50%-80%) is used for training and the rest—for validation. In many problems, however, the data are highly imbalanced in regard to different classes or does not have good coverage of the feasible data space which, in turn, creates problems in validation and usage phase. In this paper, we propose a technique for synthesizing feasible and likely data to help balance the classes as well as to boost the performance in terms of confusion matrix as well as overall. The idea, in a nutshell, is to synthesize data samples in close vicinity to the actual data samples specifically for the less represented (minority) classes. This has also implications to the so-called fairness of machine learning. In this paper, we propose a specific method for synthesizing data in a way to balance the classes and boost the performance, especially of the minority classes. It is generic and can be applied to different base algorithms, for example, support vector machines, k-nearest neighbour classifiers deep neural, rule-based classifiers, decision trees, and so forth. The results demonstrated that (a) a significantly more balanced (and fair) classification results can be achieved and (b) that the overall performance as well as the performance per class measured by confusion matrix can be boosted. In addition, this approach can be very valuable for the cases when the number of actual available labelled data is small which itself is one of the problems of the contemporary machine learning. 相似文献
3.
4.
5.
This paper presents an innovative solution to model distributed adaptive systems in biomedical environments. We present an original TCBR-HMM (Text Case Based Reasoning-Hidden Markov Model) for biomedical text classification based on document content. The main goal is to propose a more effective classifier than current methods in this environment where the model needs to be adapted to new documents in an iterative learning frame. To demonstrate its achievement, we include a set of experiments, which have been performed on OSHUMED corpus. Our classifier is compared with Naive Bayes and SVM techniques, commonly used in text classification tasks. The results suggest that the TCBR-HMM Model is indeed more suitable for document classification. The model is empirically and statistically comparable to the SVM classifier and outperforms it in terms of time efficiency. 相似文献
6.
In this article we illustrate a methodology for building cross-language search engine. A synergistic approach between thesaurus-based approach and corpus-based approach is proposed. First, a bilingual ontology thesaurus is designed with respect to two languages: English and Spanish, where a simple bilingual listing of terms, phrases, concepts, and subconcepts is built. Second, term vector translation is used – a statistical multilingual text retrieval techniques that maps statistical information about term use between languages (Ontology co-learning). These techniques map sets of t f id f term weights from one language to another. We also applied a query translation method to retrieve multilingual documents with an expansion technique for phrasal translation. Finally, we present our findings. 相似文献
7.
The proposed work involves the multiobjective PSO based adaption of optimal neural network topology for the classification of multispectral satellite images. It is per pixel supervised classification using spectral bands (original feature space). This paper also presents a thorough experimental analysis to investigate the behavior of neural network classifier for given problem. Based on 1050 number of experiments, we conclude that following two critical issues needs to be addressed: (1) selection of most discriminative spectral bands and (2) determination of optimal number of nodes in hidden layer. We propose new methodology based on multiobjective particle swarm optimization (MOPSO) technique to determine discriminative spectral bands and the number of hidden layer node simultaneously. The accuracy with neural network structure thus obtained is compared with that of traditional classifiers like MLC and Euclidean classifier. The performance of proposed classifier is evaluated quantitatively using Xie-Beni and β indexes. The result shows the superiority of the proposed method to the conventional one. 相似文献
8.
The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time. 相似文献
9.
The architectural choices underlying Linked Data have led to a compendium of data sources which contain both duplicated and fragmented information on a large number of domains. One way to enable non-experts users to access this data compendium is to provide keyword search frameworks that can capitalize on the inherent characteristics of Linked Data. Developing such systems is challenging for three main reasons. First, resources across different datasets or even within the same dataset can be homonyms. Second, different datasets employ heterogeneous schemas and each one may only contain a part of the answer for a certain user query. Finally, constructing a federated formal query from keywords across different datasets requires exploiting links between the different datasets on both the schema and instance levels. We present Sina, a scalable keyword search system that can answer user queries by transforming user-supplied keywords or natural-languages queries into conjunctive SPARQL queries over a set of interlinked data sources. Sina uses a hidden Markov model to determine the most suitable resources for a user-supplied query from different datasets. Moreover, our framework is able to construct federated queries by using the disambiguated resources and leveraging the link structure underlying the datasets to query. We evaluate Sina over three different datasets. We can answer 25 queries from the QALD-1 correctly. Moreover, we perform as well as the best question answering system from the QALD-3 competition by answering 32 questions correctly while also being able to answer queries on distributed sources. We study the runtime of SINA in its mono-core and parallel implementations and draw preliminary conclusions on the scalability of keyword search on Linked Data. 相似文献
10.
在分析单一MU(Most Uncertainty)采样缺陷的基础上,提出一种"全局最优搜寻"方法 GOS(Global Optimal Search),并结合MU共同完成查询选择。GOS+MU方法中,GOS着眼全局寻找目标,在应用环境能提供的训练样本数量有限、分类器受训不充分时,该方法选择的对象学习价值高,能快速推进分类器学习进程;MU则能够在GOS采样失效情形下,利用分类器当前训练成果,选择查询不确定性最强的样本补充训练集。通过对网络商品的用户评论进行分类仿真,并比较其他采样学习方法的效果,证明了GOS+MU方法在压缩学习成本、提高训练效率方面的有效性。 相似文献