全文获取类型
收费全文 | 7108篇 |
免费 | 1326篇 |
国内免费 | 1367篇 |
专业分类
电工技术 | 404篇 |
综合类 | 1129篇 |
化学工业 | 109篇 |
金属工艺 | 89篇 |
机械仪表 | 505篇 |
建筑科学 | 111篇 |
矿业工程 | 108篇 |
能源动力 | 65篇 |
轻工业 | 82篇 |
水利工程 | 71篇 |
石油天然气 | 59篇 |
武器工业 | 40篇 |
无线电 | 802篇 |
一般工业技术 | 366篇 |
冶金工业 | 50篇 |
原子能技术 | 12篇 |
自动化技术 | 5799篇 |
出版年
2024年 | 156篇 |
2023年 | 366篇 |
2022年 | 508篇 |
2021年 | 459篇 |
2020年 | 312篇 |
2019年 | 232篇 |
2018年 | 233篇 |
2017年 | 266篇 |
2016年 | 273篇 |
2015年 | 331篇 |
2014年 | 384篇 |
2013年 | 405篇 |
2012年 | 534篇 |
2011年 | 531篇 |
2010年 | 423篇 |
2009年 | 464篇 |
2008年 | 490篇 |
2007年 | 461篇 |
2006年 | 435篇 |
2005年 | 365篇 |
2004年 | 290篇 |
2003年 | 263篇 |
2002年 | 194篇 |
2001年 | 194篇 |
2000年 | 162篇 |
1999年 | 165篇 |
1998年 | 123篇 |
1997年 | 133篇 |
1996年 | 94篇 |
1995年 | 94篇 |
1994年 | 77篇 |
1993年 | 61篇 |
1992年 | 54篇 |
1991年 | 45篇 |
1990年 | 43篇 |
1989年 | 33篇 |
1988年 | 35篇 |
1987年 | 10篇 |
1986年 | 11篇 |
1985年 | 11篇 |
1984年 | 16篇 |
1983年 | 7篇 |
1982年 | 11篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1976年 | 8篇 |
1975年 | 4篇 |
1973年 | 3篇 |
排序方式: 共有9801条查询结果,搜索用时 31 毫秒
41.
文本阅读能力差和视觉推理能力不足是现有视觉问答(visual question answering, VQA)模型效果不好的主要原因,针对以上问题,设计了一个基于图神经网络的多模态推理(multi-modal reasoning graph neural network, MRGNN)模型。利用图像中多种形式的信息帮助理解场景文本内容,将场景文本图片分别预处理成视觉对象图和文本图的形式,并且在问题自注意力模块下过滤多余的信息;使用加入注意力的聚合器完善子图之间相互的节点特征,从而融合不同模态之间的信息,更新后的节点利用不同模态的上下文信息为答疑模块提供了更好的功能。在ST-VQA和TextVQA数据集上验证了有效性,实验结果表明,相比较此任务的一些其他模型,MRGNN模型在此任务上有明显的提升。 相似文献
42.
在缺乏用户交互互补项目方面数据的情况下,将用户对项目的偏好融合到只考虑项目关系的互补项目推荐中,提高推荐模型的性能。提出一种基于知识图谱的互补项目推荐方法,在用户历史交互项目集中推测用户交互的互补项目,基于知识图谱提取用户对互补项目的偏好,利用图像与文本学习项目之间的互补关系,最后基于神经网络实现二者的共同学习。提出的方法在Amazon数据集上与次优的基线方法相比,ACC提升了7%,precision提升了3%,这说明提出的方法性能优异。该算法共同学习用户对项目的偏好与项目之间的互补关系,提升了推荐性能。 相似文献
43.
现存非负矩阵分解(non-negative matrix factorization,NMF)研究多考虑单一视图分解数据,忽略了数据信息的全面性。此外,NMF限制其获取数据的内在几何结构。针对以上问题,提出一个结构正则化多视图非负矩阵分解算法(structure regularized multi-view nonnegative matrix factorization,SRMNMF)。首先,通过主成分分析来对数据进行全局结构的判别式学习;其次,利用流形学习来捕获数据的局部结构;然后,通过利用多视图数据的多样性和差异性来学习表征。模型提升了算法聚类的整体性能,更加有效地挖掘数据的结构信息。此外,采用高效的交替迭代算法优化目标函数得到最优的因子矩阵。在六个数据集上与现存的代表性方法比较,所提出的SRMNMF的准确率、NMI和Purity分别最大提高4.4%、6.1%和4.05%。 相似文献
44.
Entity linking is a fundamental task in natural language processing. The task of entity linking with knowledge graphs aims at linking mentions in text to their correct entities in a knowledge graph like DBpedia or YAGO2. Most of existing methods rely on hand‐designed features to model the contexts of mentions and entities, which are sparse and hard to calibrate. In this paper, we present a neural model that first combines co‐attention mechanism with graph convolutional network for entity linking with knowledge graphs, which extracts features of mentions and entities from their contexts automatically. Specifically, given the context of a mention and one of its candidate entities' context, we introduce the co‐attention mechanism to learn the relatedness between the mention context and the candidate entity context, and build the mention representation in consideration of such relatedness. Moreover, we propose a context‐aware graph convolutional network for entity representation, which takes both the graph structure of the candidate entity and its relatedness with the mention context into consideration. Experimental results show that our model consistently outperforms the baseline methods on five widely used datasets. 相似文献
45.
Computer networks face a variety of cyberattacks. Most network attacks are contagious and destructive, and these types of attacks can be harmful to society and computer network security. Security evaluation is an effective method to solve network security problems. For accurate assessment of the vulnerabilities of computer networks, this paper proposes a network security risk assessment method based on a Bayesian network attack graph (B_NAG) model. First, a new resource attack graph (RAG) and the algorithm E-Loop, which is applied to eliminate loops in the B_NAG, are proposed. Second, to distinguish the confusing relationships between nodes of the attack graph in the conversion process, a related algorithm is proposed to generate the B_NAG model. Finally, to analyze the reachability of paths in B_NAG, the measuring indexs such as node attack complexity and node state transition are defined, and an iterative algorithm for obtaining the probability of reaching the target node is presented. On this basis, the posterior probability of related nodes can be calculated. A simulation environment is set up to evaluate the effectiveness of the B_NAG model. The experimental results indicate that the B_NAG model is realistic and effective in evaluating vulnerabilities of computer networks and can accurately highlight the degree of vulnerability in a chaotic relationship. 相似文献
46.
As the keystones of the personalized manufacturing, the Industrial Internet of Things (IIoT) consolidated with 3D printing pave the path for the era of Industry 4.0 and smart manufacturing. By resembling the age of craft manufacturing, Industry 4.0 expedites the alteration from mass production to mass customization. When distributed 3D printers (3DPs) are shared and collaborated in the IIoT, a promising dynamic, globalized, economical, and time-effective manufacturing environment for customized products will appear. However, the optimum allocation and scheduling of the personalized 3D printing tasks (3DPTs) in the IIoT in a manner that respects the customized attributes submitted for each model while satisfying not only the real-time requirements but also the workload balancing between the distributed 3DPs is an inevitable research challenge that needs further in-depth investigations. Therefore, to address this issue, this paper proposes a real-time green-aware multi-task scheduling architecture for personalized 3DPTs in the IIoT. The proposed architecture is divided into two interconnected folds, namely, allocation and scheduling. A robust online allocation algorithm is proposed to generate the optimal allocation for the 3DPTs. This allocation algorithm takes into consideration meeting precisely the customized user-defined attributes for each submitted 3DPT in the IIoT as well as balancing the workload between the distributed 3DPs simultaneously with improving their energy efficiency. Moreover, meeting the predefined deadline for each submitted 3DPT is among the main objectives of the proposed architecture. Consequently, an adaptive real-time multi-task priority-based scheduling (ARMPS) algorithm has been developed. The built ARMPS algorithm respects both the dynamicity and the real-time requirements of the submitted 3DPTs. A set of performance evaluation tests has been performed to thoroughly investigate the robustness of the proposed algorithm. Simulation results proved the robustness and scalability of the proposed architecture that surpasses its counterpart state-of-the-art architectures, especially in high-load environments. 相似文献
47.
将图论与机器学习方法相结合的阿尔茨海默病计算机辅助中,脑网络的构建大多是基于滤波去噪后的全频段BOLD信号匹配,忽略了不同脑活动信息的差异.因此,本文提出了一种多频段脑功能网络融合模型.首先将离散小波变换应用于BOLD信号中,得到不同频域下的体素信号,而后计算同频信号的相关性,获取不同频段下相关矩阵.而后计算所有矩阵的网络特征,在特征选择后基于SVM对患者进行分类.从实验结果可以看出,分频下的脑功能网络特征与未分频网络相比能在一定程度上提高分类的准确性;体素级网络由于可以更加详细的表达脑网络的变化,其分类效果要优于脑区级. 相似文献
48.
针对入侵检测中存在的非确定性推理问题,文章提出一种基于二分图模型和贝叶斯网络的入侵检测方法,该方法利用二分有向图模型表示入侵和相关特征属性之间的因果拓扑关系,利用训练数据中获取模型的概率参数,最后使用最大可能解释对转化后的推理问题进行推理,并通过限定入侵同时发生的数目来提高检测效率。实验表明,该方法具有较高的检测率和很好的鲁棒性。 相似文献
49.
Finding a path that satisfies multiple Quality-of-Service (QoS) constraints is vital to the deployment of current emerged services. However, existing algorithms are not very efficient and effective at finding such a path. Moreover, few works focus on three or more QoS constraints. In this paper, we present an enhanced version of fully polynomial time approximation scheme (EFPTAS) for multiconstrainted path optimal (MCOP) problem. Specifically, we make four major contributions. We first allow the proposed algorithm to construct an auxiliary graph, through which the QoS parameters on each of the finding path can be guaranteed not to exceed the given constraints. Then we adopt a concept, called nonlinear definition of path constraints in EFPTAS for reducing both time and space complexity. Also, we enable EFPTAS to run iteratively to facilitate a progressive refinement of the finding result. In addition to these, we identify some “deployment” issues for proposed algorithm, the essential steps that how and when the EFPTAS takes place are presented. By analyzing the proposed algorithm theoretically, we find that the presented EFPTAS can find a (1+ε)-approximation path in the network with time complexity O(|E||V|/ε) (where |E| is the number of edges and |V| is the number of nodes), which outperforms the previous best-known algorithm for MCOP. We conduct an extensive comparison between the algorithm presented in this paper and previous best-known study experimentally, our results indicate that EFPTAS can find a path with low complexity and preferable quality. 相似文献
50.
李菁 《计算机与数字工程》2012,40(8):80-83
随着科技的快速发展,设备系统的复杂程度越来越高,多信号流模型是系统测试性分析的常用模型,为解决复杂系统建模分析时对其各分系统信息保密问题,提出了一种基于多信号流模型的模型封装与解包方法。该方法首先确定了封装模块数据信息并实现封装,然后构建封装模块测试信息描述表,描述了封装模块内部故障、内部测试与外部信息的关系以及封装模块本身对外部信息的影响,实现了模块的解包。实验表明,该描述方法可以有效地屏蔽了被封装的分系统模型的技术信息,有利于各分系统设计者之间的信息保密,同时利用该描述方法,还可以有效地减少测试性分析所需的时间。 相似文献