全文获取类型
收费全文 | 56661篇 |
免费 | 4147篇 |
国内免费 | 2776篇 |
专业分类
电工技术 | 3118篇 |
技术理论 | 2篇 |
综合类 | 2621篇 |
化学工业 | 7956篇 |
金属工艺 | 3803篇 |
机械仪表 | 2748篇 |
建筑科学 | 3499篇 |
矿业工程 | 1080篇 |
能源动力 | 1725篇 |
轻工业 | 4664篇 |
水利工程 | 847篇 |
石油天然气 | 1960篇 |
武器工业 | 339篇 |
无线电 | 6706篇 |
一般工业技术 | 10357篇 |
冶金工业 | 5098篇 |
原子能技术 | 754篇 |
自动化技术 | 6307篇 |
出版年
2024年 | 234篇 |
2023年 | 799篇 |
2022年 | 1514篇 |
2021年 | 1921篇 |
2020年 | 1546篇 |
2019年 | 1314篇 |
2018年 | 1610篇 |
2017年 | 1667篇 |
2016年 | 1591篇 |
2015年 | 1911篇 |
2014年 | 2488篇 |
2013年 | 3780篇 |
2012年 | 3471篇 |
2011年 | 4029篇 |
2010年 | 3250篇 |
2009年 | 3245篇 |
2008年 | 3207篇 |
2007年 | 3037篇 |
2006年 | 2794篇 |
2005年 | 2377篇 |
2004年 | 1738篇 |
2003年 | 1537篇 |
2002年 | 1432篇 |
2001年 | 1356篇 |
2000年 | 1375篇 |
1999年 | 1346篇 |
1998年 | 1953篇 |
1997年 | 1456篇 |
1996年 | 1302篇 |
1995年 | 863篇 |
1994年 | 739篇 |
1993年 | 568篇 |
1992年 | 413篇 |
1991年 | 377篇 |
1990年 | 258篇 |
1989年 | 269篇 |
1988年 | 173篇 |
1987年 | 127篇 |
1986年 | 97篇 |
1985年 | 84篇 |
1984年 | 54篇 |
1983年 | 44篇 |
1982年 | 46篇 |
1981年 | 38篇 |
1980年 | 31篇 |
1979年 | 11篇 |
1976年 | 19篇 |
1975年 | 11篇 |
1973年 | 10篇 |
1959年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
992.
针对Android存在的特权提升攻击问题,提出了基于动态权限集的Android强制访问控制模型DP_ManDroid。该模型首先分析强连通分支的权限分布特性,构建动态的权限集划分;然后在信息流与权限集耦合的基础上,抽象权限提升路径;最后提出线性时间的访问控制算法,并通过动态追踪权限集,实现了细粒度的决策控制。与现有 安全模型的对比,以及在原型系统上的仿真结果表明,所提出的安全模型很好地抵御了特权提升攻击,同时降低了时间复杂度。 相似文献
993.
994.
空间网络是空地一体化组网中地面网络延伸的重要组成部分。针对空间网络为移动星座的场景,传统的空地一体化组网模型将空间网络视为独立自治域,利用边界网关协议将空间网络与地面自治域互联起来,最大化同地面网络保持兼容。然而,传统组网模型存在边界网关面临频繁会话中断或大量路由更新等问题。通过重新审视空间网络的角色定位和边界划定问题,提出一种面向空地一体化组网的体系架构Slink。Slink的核心思想是空间网络为地面网络提供互联通道,利用星地网关隔离空地两网间的路由更新。实验仿真表明,Slink体系架构能够有效减小对空间路由器的路由存储空间需求,降低星地网络间的带宽消耗。 相似文献
995.
为了提高径向基函数RBF神经网络预测模型对短时交通流的预测准确性,提出了一种基于改进人工蜂群算法优化RBF神经网络的短时交通流预测模型。利用改进人工蜂群算法确定RBF网络隐含层的中心值以及隐含层单元数,然后训练改进的人工蜂群算法RBF神经网络预测模型,并将其应用到某城市4天的短时交通流量数据的验证。将实验结果与传统RBF神经网络预测模型、BP神经网络预测模型和小波神经网络预测模型进行了比较。对比结果表明,该方法对短时交通流具有更高的预测准确性。 相似文献
996.
Two general integral inequalities and their applications to stability analysis for systems with time‐varying delay 下载免费PDF全文
Integral inequalities have been widely used in stability analysis for systems with time‐varying delay because they directly produce bounds for integral terms with respect to quadratic functions. This paper presents two general integral inequalities from which almost all of the existing integral inequalities can be obtained, such as Jensen inequality, the Wirtinger‐based inequality, the Bessel–Legendre inequality, the Wirtinger‐based double integral inequality, and the auxiliary function‐based integral inequalities. Based on orthogonal polynomials defined in different inner spaces, various concrete single/multiple integral inequalities are obtained. They can produce more accurate bounds with more orthogonal polynomials considered. To show the effectiveness of the new inequalities, their applications to stability analysis for systems with time‐varying delay are demonstrated with two numerical examples. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
997.
Graph determines the performance of graph-based semi-supervised classification. In this paper, we investigate how to construct a graph from multiple clusterings and propose a method called Semi-Supervised Classification using Multiple Clusterings (SSCMC in short). SSCMC firstly projects original samples into different random subspaces and performs clustering on the projected samples. Then, it constructs a graph by setting an edge between two samples if these two samples are clustered in the same cluster for each clustering. Next, it combines these graphs into a composite graph and incorporates the resulting composite graph with a graph-based semi-supervised classifier based on local and global consistency. Our experimental results on two publicly available facial images show that SSCMC not only achieves higher accuracy than other related methods, but also is robust to input parameters. 相似文献
998.
999.
Simone Marras James F. Kelly Margarida Moragues Andreas Müller Michal A. Kopera Mariano Vázquez Francis X. Giraldo Guillaume Houzeaux Oriol Jorba 《Archives of Computational Methods in Engineering》2016,23(4):673-722
Numerical weather prediction (NWP) is in a period of transition. As resolutions increase, global models are moving towards fully nonhydrostatic dynamical cores, with the local and global models using the same governing equations; therefore we have reached a point where it will be necessary to use a single model for both applications. The new dynamical cores at the heart of these unified models are designed to scale efficiently on clusters with hundreds of thousands or even millions of CPU cores and GPUs. Operational and research NWP codes currently use a wide range of numerical methods: finite differences, spectral transform, finite volumes and, increasingly, finite/spectral elements and discontinuous Galerkin, which constitute element-based Galerkin (EBG) methods. Due to their important role in this transition, will EBGs be the dominant power behind NWP in the next 10 years, or will they just be one of many methods to choose from? One decade after the review of numerical methods for atmospheric modeling by Steppeler et al. (Meteorol Atmos Phys 82:287–301, 2003), this review discusses EBG methods as a viable numerical approach for the next-generation NWP models. One well-known weakness of EBG methods is the generation of unphysical oscillations in advection-dominated flows; special attention is hence devoted to dissipation-based stabilization methods. Since EBGs are geometrically flexible and allow both conforming and non-conforming meshes, as well as grid adaptivity, this review is concluded with a short overview of how mesh generation and dynamic mesh refinement are becoming as important for atmospheric modeling as they have been for engineering applications for many years. 相似文献
1000.