全文获取类型
收费全文 | 2528篇 |
免费 | 197篇 |
国内免费 | 143篇 |
专业分类
电工技术 | 97篇 |
综合类 | 140篇 |
化学工业 | 63篇 |
金属工艺 | 11篇 |
机械仪表 | 43篇 |
建筑科学 | 95篇 |
矿业工程 | 28篇 |
能源动力 | 60篇 |
轻工业 | 5篇 |
水利工程 | 72篇 |
石油天然气 | 11篇 |
武器工业 | 12篇 |
无线电 | 515篇 |
一般工业技术 | 157篇 |
冶金工业 | 33篇 |
原子能技术 | 4篇 |
自动化技术 | 1522篇 |
出版年
2024年 | 5篇 |
2023年 | 19篇 |
2022年 | 25篇 |
2021年 | 21篇 |
2020年 | 32篇 |
2019年 | 36篇 |
2018年 | 58篇 |
2017年 | 57篇 |
2016年 | 63篇 |
2015年 | 75篇 |
2014年 | 117篇 |
2013年 | 138篇 |
2012年 | 191篇 |
2011年 | 223篇 |
2010年 | 151篇 |
2009年 | 156篇 |
2008年 | 181篇 |
2007年 | 218篇 |
2006年 | 196篇 |
2005年 | 173篇 |
2004年 | 139篇 |
2003年 | 117篇 |
2002年 | 89篇 |
2001年 | 63篇 |
2000年 | 74篇 |
1999年 | 45篇 |
1998年 | 25篇 |
1997年 | 35篇 |
1996年 | 20篇 |
1995年 | 17篇 |
1994年 | 16篇 |
1993年 | 17篇 |
1992年 | 10篇 |
1991年 | 7篇 |
1990年 | 13篇 |
1989年 | 9篇 |
1988年 | 10篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 1篇 |
排序方式: 共有2868条查询结果,搜索用时 15 毫秒
91.
92.
93.
94.
针对水声传感器网络的特殊性,提出一种基于多种群萤火虫的路由协议,以确保数据包在水声传感器网络各节点之间正确、高效地转发。首先构造水声传感器网络的网络模型;然后,设计3种类型的萤火虫,通过各种萤火虫之间的协同工作提高路由路径构建的自适应性并实现路由路径的选择和优化。仿真实验结果表明,与传统的水声传感器网络路由协议相比,在节点数量相同情的况下,该路由协议的数据包传送率更高,平均端到端延时更低,并且在平均数据传送率相同情况下,网络吞吐量更大。 相似文献
95.
96.
A multi-secret sharing scheme is a protocol to share m arbitrarily related secrets s1, … , sm among a set of n participants. In this paper, we propose an ideal linear multi-secret sharing scheme, based on monotone span programs, where each subset of the set of participants may have the associated secret. Our scheme can be used to meet the security requirement in practical applications, such as secure group communication and privacy preserving data mining etc. We also prove that our proposed scheme satisfies the definition of a perfect multi-secret sharing scheme. 相似文献
97.
Ahmet Zengin Author Vitae 《Information Sciences》2011,181(5):1028-1043
Scalability in simulation tools is one of the most important traits to measure performance of software. The reason is that today’s Internet is the main instance of a large-scale and highly complex system. Simulation of Internet-scale network systems has to be supported by any simulation tool. Despite this fact, many network simulators lacks support for building large models. In this work, in order to propose a new approach for scalability issue in network simulation tools, a network simulator is developed based on behavior of honeybees and high performance DEVS, modular and hierarchical system theoretic approach. A biologically-inspired discrete event modeling approach is described for studying networks’ scalability and performance traits. Since natural systems can offer important concepts for modeling network systems, key adaptive and emergent attributes of honeybees and their societal properties are incorporated into a set of simulation models that are developed using the discrete event system specification approach. Large-scale network models are simulated and evaluated to show the benefits of nature-inspired network models. 相似文献
98.
Semi-implicit and Newton-like finite element methods are developed for the stationary compressible Euler equations. The Galerkin discretization of the inviscid fluxes is potentially oscillatory and unstable. To suppress numerical oscillations, the spatial discretization is performed by a high-resolution finite element scheme based on algebraic flux correction. A multidimensional limiter of TVD type is employed. An important goal is the efficient computation of stationary solutions in a wide range of Mach numbers, which is a challenging task due to oscillatory correction factors associated with TVD-type flux limiters. A semi-implicit scheme is derived by a time-lagged linearization of the nonlinear residual, and a Newton-like method is obtained in the limit of infinite CFL numbers. Special emphasis is laid on the numerical treatment of weakly imposed characteristic boundary conditions. Numerical evidence for unconditional stability is presented. It is shown that the proposed approach offers higher accuracy and better convergence behavior than algorithms in which the boundary conditions are implemented in a strong sense. 相似文献
99.
Quality of service (QoS) provisioning in wireless mesh networks (WMNs) is an open issue to support emerging multimedia services. In this paper, we study the problem of QoS provisioning in terms of end-to-end bandwidth allocation in WMNs. It is challenging due to interferences in the networks. We consider widely used interference models and show that except a few special cases, the problem of finding a feasible path is NP-complete under the models. We propose a k-shortest path based algorithmic framework to solve this problem. We also consider the problem of optimizing network performance by on-line dynamic routing, and adapt commonly used conventional QoS routing metrics to be used in WMNs. We find the optimal solutions for these problems through formulating them as optimization models. A model is developed to check the existence of a feasible path and another to find the optimal path for a demand; moreover, an on-line optimal QoS routing algorithm is developed. Comparing the algorithms implemented by the proposed framework with the optimization models shows that our solution can find existing feasible paths with high probability, efficiently optimizes path lengths, and has a comparable performance to the optimal QoS routing algorithm. Furthermore, our results show that contrary to wireline networks, minimizing resource consumption should be preferred over load distribution even in lightly loaded WMNs. 相似文献
100.