全文获取类型
收费全文 | 23817篇 |
免费 | 3185篇 |
国内免费 | 2623篇 |
专业分类
电工技术 | 808篇 |
技术理论 | 8篇 |
综合类 | 3234篇 |
化学工业 | 1331篇 |
金属工艺 | 246篇 |
机械仪表 | 745篇 |
建筑科学 | 2421篇 |
矿业工程 | 756篇 |
能源动力 | 240篇 |
轻工业 | 2802篇 |
水利工程 | 425篇 |
石油天然气 | 614篇 |
武器工业 | 90篇 |
无线电 | 2016篇 |
一般工业技术 | 1310篇 |
冶金工业 | 621篇 |
原子能技术 | 130篇 |
自动化技术 | 11828篇 |
出版年
2024年 | 162篇 |
2023年 | 533篇 |
2022年 | 975篇 |
2021年 | 1166篇 |
2020年 | 1052篇 |
2019年 | 864篇 |
2018年 | 832篇 |
2017年 | 905篇 |
2016年 | 870篇 |
2015年 | 994篇 |
2014年 | 1583篇 |
2013年 | 1386篇 |
2012年 | 1756篇 |
2011年 | 1872篇 |
2010年 | 1589篇 |
2009年 | 1594篇 |
2008年 | 1587篇 |
2007年 | 1822篇 |
2006年 | 1513篇 |
2005年 | 1166篇 |
2004年 | 1068篇 |
2003年 | 838篇 |
2002年 | 709篇 |
2001年 | 515篇 |
2000年 | 438篇 |
1999年 | 373篇 |
1998年 | 273篇 |
1997年 | 202篇 |
1996年 | 189篇 |
1995年 | 153篇 |
1994年 | 132篇 |
1993年 | 88篇 |
1992年 | 64篇 |
1991年 | 45篇 |
1990年 | 55篇 |
1989年 | 36篇 |
1988年 | 26篇 |
1987年 | 19篇 |
1986年 | 26篇 |
1985年 | 21篇 |
1984年 | 20篇 |
1983年 | 25篇 |
1982年 | 12篇 |
1981年 | 16篇 |
1980年 | 11篇 |
1979年 | 7篇 |
1978年 | 9篇 |
1977年 | 6篇 |
1975年 | 4篇 |
1958年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Aggregate question answering essentially returns answers for given questions by obtaining query graphs with unique dependencies between values and corresponding objects. Word order dependency, as the key to uniquely identify dependency of the query graph, reflects the dependencies between the words in the question. However, due to the semantic gap caused by the expression difference between questions encoded with word vectors and query graphs represented with logical formal elements, it is not trivial to match the correct query graph for the question. Most existing approaches design more expressive query graphs for complex questions and rank them just by directly calculating their similarities, ignoring the semantic gap between them. In this paper, we propose a novel Structure-sensitive Semantic Matching(SSM) approach that learns aligned representations of dependencies in questions and query graphs to eliminate their gap. First, we propose a cross-structure matching module to bridge the gap between two modalities(i.e., textual question and query graph). Then, we propose an entropy-based gated AQG filter to remove the structural noise caused by the uncertainty of dependencies. Finally, we present a two-channel query graph representation that fuses the semantics of abstract structure and grounding content of the query graph explicitly. Experimental results show that SSM could learn aligned representations of questions and query graphs to eliminate the gaps between their dependencies, and improves up to 12% (F1 score) on aggregation questions of two benchmark datasets. 相似文献
2.
The International Society for the Study of Vascular Anomalies (ISSVA) provides a classification for vascular anomalies that enables specialists to unambiguously classify diagnoses. This classification is only available in PDF format and is not machine-readable, nor does it provide unique identifiers that allow for structured registration. In this paper, we describe the process of transforming the ISSVA classification into an ontology. We also describe the structure of this ontology, as well as two applications of the ontology using examples from the domain of rare disease research. We used the expertise of an ontology expert and clinician during the development process. We semi-automatically added mappings to relevant external ontologies using automated ontology matching systems and manual assessment by experts. The ISSVA ontology should contribute to making data for vascular anomaly research more Findable, Accessible, Interoperable, and Reusable (FAIR). The ontology is available at https://bioportal.bioontology.org/ontologies/ISSVA. 相似文献
3.
4.
Ava Kwong Cecilia Y. S. Ho Vivian Y. Shin Chun Hang Au Tsun Leung Chan Edmond S. K. Ma 《International journal of molecular sciences》2021,22(2)
The germline carrier of the BRCA1 pathogenic mutation has been well proven to confer an increased risk of breast and ovarian cancer. Despite BRCA1 biallelic pathogenic mutations being extremely rare, they have been reported to be embryonically lethal or to cause Fanconi anemia (FA). Here we describe a patient who was a 48-year-old female identified with biallelic pathogenic mutations of the BRCA1 gene, with no or very subtle FA-features. She was diagnosed with ovarian cancer and breast cancer at the ages of 43 and 44 and had a strong family history of breast and gynecological cancers. 相似文献
5.
With the emergence of large-scale knowledge base, how to use triple information to generate natural questions is a key technology in question answering systems. The traditional way of generating questions require a lot of manual intervention and produce lots of noise. To solve these problems, we propose a joint model based on semi-automated model and End-to-End neural network to automatically generate questions. The semi-automated model can generate question templates and real questions combining the knowledge base and center graph. The End-to-End neural network directly sends the knowledge base and real questions to BiLSTM network. Meanwhile, the attention mechanism is utilized in the decoding layer, which makes the triples and generated questions more relevant. Finally, the experimental results on SimpleQuestions demonstrate the effectiveness of the proposed approach. 相似文献
6.
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. 相似文献
7.
8.
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. 相似文献
9.
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. 相似文献
10.
目前网络上的服装图像数量增长迅猛,对于大量服装图像实现智能分类的需求日益增加。将基于区域的全卷积网络(Region-Based Fully Convolutional Networks,R-FCN)引入到服装图像识别中,针对服装图像分类中网络训练时间长、形变服装图像识别率低的问题,提出一种新颖的改进框架HSR-FCN。新框架将R-FCN中的区域建议网络和HyperNet网络相融合,改变图片特征学习方式,使得HSR-FCN可以在更短的训练时间内达到更高的准确率。在模型中引入了空间转换网络,对输入服装图像和特征图进行了空间变换及对齐,加强了对多角度服装和形变服装的特征学习。实验结果表明,改进后的HSR-FCN模型有效地加强了对形变服装图像的学习,且在训练时间更短的情况下,比原来的网络模型R-FCN平均准确率提高了大约3个百分点,达到96.69%。 相似文献