全文获取类型
收费全文 | 55161篇 |
免费 | 5669篇 |
国内免费 | 2099篇 |
专业分类
电工技术 | 3550篇 |
技术理论 | 2篇 |
综合类 | 4183篇 |
化学工业 | 8154篇 |
金属工艺 | 2979篇 |
机械仪表 | 3451篇 |
建筑科学 | 3735篇 |
矿业工程 | 1478篇 |
能源动力 | 1439篇 |
轻工业 | 6055篇 |
水利工程 | 1260篇 |
石油天然气 | 2141篇 |
武器工业 | 501篇 |
无线电 | 6464篇 |
一般工业技术 | 6216篇 |
冶金工业 | 2076篇 |
原子能技术 | 712篇 |
自动化技术 | 8533篇 |
出版年
2025年 | 261篇 |
2024年 | 1189篇 |
2023年 | 1087篇 |
2022年 | 1801篇 |
2021年 | 2296篇 |
2020年 | 1861篇 |
2019年 | 1643篇 |
2018年 | 1680篇 |
2017年 | 1796篇 |
2016年 | 1790篇 |
2015年 | 2327篇 |
2014年 | 2869篇 |
2013年 | 3465篇 |
2012年 | 3954篇 |
2011年 | 4374篇 |
2010年 | 3958篇 |
2009年 | 3892篇 |
2008年 | 3743篇 |
2007年 | 3488篇 |
2006年 | 3199篇 |
2005年 | 2684篇 |
2004年 | 1936篇 |
2003年 | 1463篇 |
2002年 | 1381篇 |
2001年 | 1160篇 |
2000年 | 879篇 |
1999年 | 650篇 |
1998年 | 393篇 |
1997年 | 323篇 |
1996年 | 271篇 |
1995年 | 208篇 |
1994年 | 177篇 |
1993年 | 156篇 |
1992年 | 111篇 |
1991年 | 97篇 |
1990年 | 63篇 |
1989年 | 58篇 |
1988年 | 41篇 |
1987年 | 40篇 |
1986年 | 26篇 |
1985年 | 14篇 |
1984年 | 12篇 |
1983年 | 11篇 |
1982年 | 17篇 |
1980年 | 8篇 |
1979年 | 12篇 |
1978年 | 9篇 |
1977年 | 10篇 |
1976年 | 13篇 |
1975年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
21.
Opportunistic routing is a candidate for multihop wireless routing where the network topology and radio channels vary rapidly. However, there are not many opportunistic routing algorithms that can be implemented in a real multihop wireless network while exploiting the node mobility. It motivates us to implement an opportunistic routing, random basketball routing (BR), in a real multi-robot network to see if it can enhance the capacity of the multihop network as mobility increases. For implementation purposes, we added some features, such as destination RSSI measuring, a loop-free procedure and distributed relay probability updating, to the original BR. We carried out the experiments on a real multi-robot network and compared BR with AODV combined with CSMA/CA (routing + MAC protocol). We considered both static and dynamic scenarios. Our experiments are encouraging in that BR outperforms AODV + CSMA/CA, particularly in dynamic cases; the throughput of BR is 6.6 times higher than that of AODV + CSMA/CA. BR with dynamic networks shows 1.4 times higher throughput performance than BR with static networks. We investigate the performance of BR in the large-scale network using NS-2 simulation. We verify the effect of node density, speed, destination beacon signal and loop-free procedure. According to the large-scale simulation, the end-to-end throughput grows with the node speed. 相似文献
22.
We propose a new approximate numerical algorithm for the steady-state solution of general structured ergodic Markov models. The approximation uses a state-space encoding based on multiway decision diagrams and a transition rate encoding based on a new class of edge-valued decision diagrams. The new method retains the favorable properties of a previously proposed Kronecker-based approximation, while eliminating the need for a Kronecker-consistent model decomposition. Removing this restriction allows for a greater utilization of event locality, which facilitates the generation of both the state-space and the transition rate matrix, thus extends the applicability of this algorithm to larger and more complex models. 相似文献
23.
YUAN Min 《数字社区&智能家居》2008,(34)
文章阐述了防火墙的基本原理、特点和功能,并通过实例实现基于Linux系统环境下,使用防火墙的方法。 相似文献
24.
HUANG Min 《数字社区&智能家居》2008,(35)
在VB6.0环境下,通过连接Access2000数据库,建立了一个学生管理系统。在这个系统里,可以实现学生学号,姓名,年龄,联系方式,照片等各种信息的录入,精确查找,模糊查找,更新,删除等操作。从程序的界面设计到源代码,都做了详尽的说明,适合初学者快速掌握信息管理系统开发的步骤。 相似文献
25.
Min Xu 《Information Processing Letters》2007,101(5):185-189
For a given connected graph G of order n, a routing R in G is a set of n(n−1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forwarding index of G is the maximum number of paths in R passing through any vertex (resp. edge) in G. Choudum and Sunitha [S.A. Choudum, V. Sunitha, Augmented cubes, Networks 40 (2002) 71-84] proposed a variant of the hypercube Qn, called the augmented cube AQn and presented a minimal routing algorithm. This paper determines the vertex and the edge forwarding indices of AQn as and 2n−1, respectively, which shows that the above algorithm is optimal in view of maximizing the network capacity. 相似文献
26.
Topological design considering flexibility under periodic loads 总被引:1,自引:1,他引:0
S. Nishiwaki K. Saitou S. Min N. Kikuchi 《Structural and Multidisciplinary Optimization》2000,19(1):4-16
Topology optimization has been extensively considered to design the structural configuration for the stiffness maximization
and the eigenfrequency maximization. In this paper, we construct a topology optimization method implementing flexibility with
the time-periodic loading condition. First, the flexibility in the dynamic periodic loading is formulated using the mutual
energy concept. Second, the multi-optimization problem is formulated using a new multi-objective function in order to obtain
an optimal solution incorporating both flexibility and stiffness. Next, the topology optimization procedure is developed using
the homogenization design method. Finally, some examples are provided to confirm the optimal design method presented here.
Received January 18, 1999 相似文献
27.
对上海市地铁列车中的三种不同车型的微机控制系统的总线进行分析与研究,并针对近年总线通信中出现的问题,提出改进方法。 相似文献
28.
Target expansion, i.e., the increase of target size according to cursor movement, can be a practical scheme to improve the usability of target-selection tasks using a mouse. This study examined the effects of different user age groups and target-expansion methods on target-acquisition tasks with grouped icons. Twenty-eight subjects performed acquisition tasks under eight experimental conditions: combinations of four expansion areas (no, one-icon, fish-eye, and group expansion) and two expansion techniques (occlusion and push). Older users took longer to acquire targets than younger users; however, they showed no significant difference in accuracy. Target expansion did not substantially improve performance speed compared to the static condition. However, the error rate was lowest when group area was expanded with the push technique, and both age groups were most satisfied with one-icon area expansion with the occlusion technique. We suggest alternative guidelines in designing target-expansion schemes. 相似文献
29.
卓龙华 《安徽冶金科技职业学院学报》2012,33(3):89-94
通过对公办高校廉政建设存在问题的分析,提出了在国家整个党风廉政建设和反腐败工作的要求下,要结合高等教育事业发展的实际,从"制度反腐"、"源头防腐"和"动态反腐"的高校廉政建设工作基本思路。 相似文献
30.
This paper presents an integrated framework for risk evaluation and risk allocation with bounded data in a critical risk management. A risk evaluation framework using the Imprecise Data Envelopment Analysis (IDEA) method is proposed to be applied to operations of Korean Army helicopters. The risks pertaining to pilots, missions and helicopters are evaluated based on bounded data, and pilots are appropriately allocated to missions and helicopters using goal programming with bounded risk scores. Using bounded data, two risk allocation models are developed to be used with the expected value and lower/upper limit values, resulting in improved reliability of the solutions. Numerical experiments show reasonable solutions and valuable information for risk management. 相似文献