全文获取类型
收费全文 | 7373篇 |
免费 | 1315篇 |
国内免费 | 1407篇 |
专业分类
电工技术 | 409篇 |
综合类 | 1134篇 |
化学工业 | 134篇 |
金属工艺 | 94篇 |
机械仪表 | 513篇 |
建筑科学 | 112篇 |
矿业工程 | 108篇 |
能源动力 | 73篇 |
轻工业 | 96篇 |
水利工程 | 71篇 |
石油天然气 | 60篇 |
武器工业 | 41篇 |
无线电 | 821篇 |
一般工业技术 | 390篇 |
冶金工业 | 50篇 |
原子能技术 | 13篇 |
自动化技术 | 5976篇 |
出版年
2024年 | 156篇 |
2023年 | 369篇 |
2022年 | 519篇 |
2021年 | 478篇 |
2020年 | 326篇 |
2019年 | 240篇 |
2018年 | 239篇 |
2017年 | 276篇 |
2016年 | 280篇 |
2015年 | 344篇 |
2014年 | 400篇 |
2013年 | 418篇 |
2012年 | 549篇 |
2011年 | 546篇 |
2010年 | 437篇 |
2009年 | 481篇 |
2008年 | 508篇 |
2007年 | 473篇 |
2006年 | 452篇 |
2005年 | 375篇 |
2004年 | 301篇 |
2003年 | 270篇 |
2002年 | 200篇 |
2001年 | 195篇 |
2000年 | 164篇 |
1999年 | 170篇 |
1998年 | 125篇 |
1997年 | 134篇 |
1996年 | 97篇 |
1995年 | 97篇 |
1994年 | 78篇 |
1993年 | 61篇 |
1992年 | 56篇 |
1991年 | 48篇 |
1990年 | 44篇 |
1989年 | 36篇 |
1988年 | 36篇 |
1987年 | 10篇 |
1986年 | 11篇 |
1985年 | 13篇 |
1984年 | 16篇 |
1983年 | 7篇 |
1982年 | 12篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1976年 | 8篇 |
1975年 | 4篇 |
1973年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 10 毫秒
81.
82.
83.
84.
Tabular data often refers to data that is organized in a table with rows and columns. We observe that this data format is widely used on the Web and within enterprise data repositories. Tables potentially contain rich semantic information that still needs to be interpreted. The process of extracting meaningful information out of tabular data with respect to a semantic artefact, such as an ontology or a knowledge graph, is often referred to as Semantic Table Interpretation (STI) or Semantic Table Annotation. In this survey paper, we aim to provide a comprehensive and up-to-date state-of-the-art review of the different tasks and methods that have been proposed so far to perform STI. First, we propose a new categorization that reflects the heterogeneity of table types that one can encounter, revealing different challenges that need to be addressed. Next, we define five major sub-tasks that STI deals with even if the literature has mostly focused on three sub-tasks so far. We review and group the many approaches that have been proposed into three macro families and we discuss their performance and limitations with respect to the various datasets and benchmarks proposed by the community. Finally, we detail what are the remaining scientific barriers to be able to truly automatically interpret any type of tables that can be found in the wild Web. 相似文献
85.
针对心理医学领域文本段落冗长、数据稀疏、知识散乱且规范性差的问题, 提出一种基于多层级特征抽取能力预训练模型(MFE-BERT)与前向神经网络注意力机制(FNNAttention)的心理医学知识图谱构建方法. MFE-BERT在BERT模型基础上将其内部所有Encoder层特征进行合并输出, 以获取包含更多语义的特征向量, 同时对两复合模型采用FNNAttention机制强化词级关系, 解决长文本段落语义稀释问题. 在自建的心理医学数据集中, 设计MFE-BERT-BiLSTM-FNNAttention-CRF和MFE-BERT-CNN-FNNAttention复合神经网络模型分别进行心理医学实体识别和实体关系抽取, 实体识别F1值达到93.91%, 实体关系抽精确率达到了89.29%, 通过融合文本相似度与语义相似度方法进行实体对齐, 将所整理的数据存储在Neo4j图数据库中, 构建出一个含有3652 个实体, 2396 条关系的心理医学知识图谱. 实验结果表明, 在MFE-BERT模型与FNNAttention机制的基础上构建心理医学知识图谱切实可行, 提出的改进模型所搭建的心理医学知识图谱可以更好地应用于心理医学信息管理中, 为心理医学数据分析提供参考. 相似文献
86.
Shuang LIU Fan ZHANG Baiyang ZHAO Renjie GUO Tao CHEN Meishan ZHANG 《Frontiers of Computer Science》2023,17(3):173320
With the increasing popularity of mobile devices and the wide adoption of mobile Apps, an increasing concern of privacy issues is raised. Privacy policy is identified as a proper medium to indicate the legal terms, such as the general data protection regulation (GDPR), and to bind legal agreement between service providers and users. However, privacy policies are usually long and vague for end users to read and understand. It is thus important to be able to automatically analyze the document structures of privacy policies to assist user understanding. In this work we create a manually labelled corpus containing 231 privacy policies (of more than 566,000 words and 7,748 annotated paragraphs). We benchmark our data corpus with 3 document classification models and achieve more than 82% on F1-score. 相似文献
87.
Zhe XUE Junping DU Xin XU Xiangbin LIU Junfu WANG Feifei KOU 《Frontiers of Computer Science》2023,17(2):172316
Node classification has a wide range of application scenarios such as citation analysis and social network analysis. In many real-world attributed networks, a large portion of classes only contain limited labeled nodes. Most of the existing node classification methods cannot be used for few-shot node classification. To train the model effectively and improve the robustness and reliability of the model with scarce labeled samples, in this paper, we propose a local adaptive discriminant structure learning (LADSL) method for few-shot node classification. LADSL aims to properly represent the nodes in the attributed graphs and learn a metric space with a strong discriminating power by reducing the intra-class variations and enlarging inter-class differences. Extensive experiments conducted on various attributed networks datasets demonstrate that LADSL is superior to the other methods on few-shot node classification task. 相似文献
88.
Link prediction has attracted wide attention among interdisciplinary researchers as an important issue in complex network. It aims to predict the missing links in current networks and new links that will appear in future networks. Despite the presence of missing links in the target network of link prediction studies, the network it processes remains macroscopically as a large connected graph. However, the complexity of the real world makes the complex networks abstracted from real systems often contain many isolated nodes. This phenomenon leads to existing link prediction methods not to efficiently implement the prediction of missing edges on isolated nodes. Therefore, the cold-start link prediction is favored as one of the most valuable subproblems of traditional link prediction. However, due to the loss of many links in the observation network, the topological information available for completing the link prediction task is extremely scarce. This presents a severe challenge for the study of cold-start link prediction. Therefore, how to mine and fuse more available non-topological information from observed network becomes the key point to solve the problem of cold-start link prediction. In this paper, we propose a framework for solving the cold-start link prediction problem, a joint-weighted symmetric nonnegative matrix factorization model fusing graph regularization information, based on low-rank approximation algorithms in the field of machine learning. First, the nonlinear features in high-dimensional space of node attributes are captured by the designed graph regularization term. Second, using a weighted matrix, we associate the attribute similarity and first order structure information of nodes and constrain each other. Finally, a unified framework for implementing cold-start link prediction is constructed by using a symmetric nonnegative matrix factorization model to integrate the multiple information extracted together. Extensive experimental validation on five real networks with attributes shows that the proposed model has very good predictive performance when predicting missing edges of isolated nodes. 相似文献
89.
旅游领域命名实体识别是旅游知识图谱构建过程中的关键步骤,与通用领域的实体相比,旅游文本的实体具有长度长、一词多义、嵌套严重的特点,导致命名实体识别准确率低。提出一种融合词典信息的有向图神经网络(L-CGNN)模型,用于旅游领域中的命名实体识别。将预训练词向量通过卷积神经网络提取丰富的字特征,利用词典构造句子的有向图,以生成邻接矩阵并融合字词信息,通过将包含局部特征的词向量和邻接矩阵输入图神经网络(GNN)中,提取全局语义信息,并引入条件随机场(CRF)得到最优的标签序列。实验结果表明,相比Lattice LSTM、ID-CNN+CRF、CRF等模型,L-CGNN模型在旅游和简历数据集上具有较高的识别准确率,其F1值分别达到86.86%和95.02%。 相似文献
90.
将语义数据流处理引擎与知识图谱嵌入表示学习相结合,可以有效提高实时数据流推理查询性能,但是现有的知识表示学习模型更多关注静态知识图谱嵌入,忽略了知识图谱的动态特性,导致难以应用于实时动态语义数据流推理任务。为了使知识表示学习模型适应知识图谱的在线更新并能够应用于语义数据流引擎,建立一种基于改进多嵌入空间的动态知识图谱嵌入模型PUKALE。针对传递闭包等复杂推理场景,提出3种嵌入空间生成算法。为了在进行增量更新时更合理地选择嵌入空间,设计2种嵌入空间选择算法。基于上述算法实现PUKALE模型,并将其嵌入数据流推理引擎CSPARQL-engine中,以实现实时语义数据流推理查询。实验结果表明,与传统的CSPARQL和KALE推理相比,PUKALE模型的推理查询时间分别约降低85%和93%,其在支持动态图谱嵌入的同时能够提升实时语义数据流推理准确率。 相似文献