全文获取类型
收费全文 | 14136篇 |
免费 | 2264篇 |
国内免费 | 1882篇 |
专业分类
电工技术 | 1152篇 |
综合类 | 1762篇 |
化学工业 | 385篇 |
金属工艺 | 124篇 |
机械仪表 | 651篇 |
建筑科学 | 501篇 |
矿业工程 | 163篇 |
能源动力 | 254篇 |
轻工业 | 219篇 |
水利工程 | 203篇 |
石油天然气 | 151篇 |
武器工业 | 172篇 |
无线电 | 1659篇 |
一般工业技术 | 1219篇 |
冶金工业 | 466篇 |
原子能技术 | 47篇 |
自动化技术 | 9154篇 |
出版年
2024年 | 130篇 |
2023年 | 268篇 |
2022年 | 482篇 |
2021年 | 455篇 |
2020年 | 542篇 |
2019年 | 526篇 |
2018年 | 492篇 |
2017年 | 680篇 |
2016年 | 681篇 |
2015年 | 808篇 |
2014年 | 968篇 |
2013年 | 1204篇 |
2012年 | 1170篇 |
2011年 | 1230篇 |
2010年 | 915篇 |
2009年 | 960篇 |
2008年 | 1032篇 |
2007年 | 1018篇 |
2006年 | 841篇 |
2005年 | 706篇 |
2004年 | 590篇 |
2003年 | 430篇 |
2002年 | 395篇 |
2001年 | 353篇 |
2000年 | 282篇 |
1999年 | 168篇 |
1998年 | 159篇 |
1997年 | 147篇 |
1996年 | 109篇 |
1995年 | 96篇 |
1994年 | 75篇 |
1993年 | 67篇 |
1992年 | 47篇 |
1991年 | 42篇 |
1990年 | 25篇 |
1989年 | 31篇 |
1988年 | 20篇 |
1987年 | 11篇 |
1986年 | 15篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1983年 | 13篇 |
1982年 | 14篇 |
1981年 | 12篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 6篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 9 毫秒
11.
Greg A. Breed Paul M. Severns Andrew M. Edwards 《Journal of the Royal Society Interface》2015,12(103)
Lévy flights have gained prominence for analysis of animal movement. In a Lévy flight, step-lengths are drawn from a heavy-tailed distribution such as a power law (PL), and a large number of empirical demonstrations have been published. Others, however, have suggested that animal movement is ill fit by PL distributions or contend a state-switching process better explains apparent Lévy flight movement patterns. We used a mix of direct behavioural observations and GPS tracking to understand step-length patterns in females of two related butterflies. We initially found movement in one species (Euphydryas editha taylori) was best fit by a bounded PL, evidence of a Lévy flight, while the other (Euphydryas phaeton) was best fit by an exponential distribution. Subsequent analyses introduced additional candidate models and used behavioural observations to sort steps based on intraspecific interactions (interactions were rare in E. phaeton but common in E. e. taylori). These analyses showed a mixed-exponential is favoured over the bounded PL for E. e. taylori and that when step-lengths were sorted into states based on the influence of harassing conspecific males, both states were best fit by simple exponential distributions. The direct behavioural observations allowed us to infer the underlying behavioural mechanism is a state-switching process driven by intraspecific interactions rather than a Lévy flight. 相似文献
12.
13.
Efficient multicast search under delay and bandwidth constraints 总被引:1,自引:0,他引:1
The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over
only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal
is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has
been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search
cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search
delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost
is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency
between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard.
We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed
strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior
to the implementation of an optimal single user search on a group of users.
Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both
from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California.
From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February
1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University,
Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor
with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York.
Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with
the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks,
mobility, search strategies, and multiple access protocols. 相似文献
14.
移动机器人路径规划方法研究 总被引:3,自引:0,他引:3
移动机器人技术研究中的一个重要领域是路径规划技术,它分为基于模型的环境已知的全局路径规划和基于传感器的环境未知的局部路径规划。综述了移动机器人路径规划技术的发展现状指出了各种方法的优点与不足,最后对移动机器人路径规划技术的发展趋势进行了展望。 相似文献
15.
16.
本文概述INMARSAT 21世纪工程的规划及为实现这一规划,INMARSAT组织在本世纪末正在进行和即将进行的一系列卫星通信技术工作。着重阐述INMARSAT 21世纪工程的业务性能以及对三种卫星布局方案进行抉择的新动向。 相似文献
17.
陈国龙 《计算机辅助设计与图形学学报》1994,6(2):136-142
本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念,通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法,但有较传统线探索法更强的探索能力,不需要结合李氏算法而能单独完成布线任务,是一种较理想的算法,通过实验获得了较为满意的效果。 相似文献
18.
An efficient path planning algorithm based on topologic method is presented in this paper.The collision free path planning for three-joint robotic arm consists of three parts:partition of C-space,construction of CN and search for a path in CN.We mainly solved the problems of partitioning the C-space and undging the connectivity between connected blocks,etc.For the motion planning of a robotic arm with a gripper,we developed the concepts of global planning and local planning,and discussed the basic factors for constructing the planning system.In the paper,some evaluation and analysis of the complexity and reliability of the algorithm are given,together with some ideas to improve the efficiency and increase the reliability.At last,some experimental results are pesented to show the efficency and accuracy of the algorithm. 相似文献
19.
该文对中国与世界IC产业的发展进行了历史回顾,重点阐述了产业现状与发展方向,并对新世纪的前景进行了科学预测。 相似文献
20.
An efficient algorithm for the random packing of spheres can significantly save the cost of the preparation of an initial configuration often required in discrete element simulations. It is not trivial to generate such random packing at a large scale, particularly when spheres of various sizes and geometric domains of different shapes are present. Motivated by the idea of compression complemented by an efficient physical process to increase packing density, shaking, a new approach, termed compression algorithm, is proposed in this work to randomly fill any arbitrary polyhedral or cylindrical domains with spheres of various sizes. The algorithm features both simplicity and high efficiency. Tests show that it takes 181 s on a 1.4-GHz PC to complete the filling of a cylindrical domain with a total number of 26,787 spheres, achieving a packing density of 52.89%. 相似文献