全文获取类型
收费全文 | 35323篇 |
免费 | 5040篇 |
国内免费 | 3182篇 |
专业分类
电工技术 | 4872篇 |
综合类 | 3498篇 |
化学工业 | 744篇 |
金属工艺 | 512篇 |
机械仪表 | 2905篇 |
建筑科学 | 739篇 |
矿业工程 | 450篇 |
能源动力 | 6382篇 |
轻工业 | 155篇 |
水利工程 | 404篇 |
石油天然气 | 836篇 |
武器工业 | 821篇 |
无线电 | 3642篇 |
一般工业技术 | 1770篇 |
冶金工业 | 533篇 |
原子能技术 | 98篇 |
自动化技术 | 15184篇 |
出版年
2024年 | 196篇 |
2023年 | 588篇 |
2022年 | 1058篇 |
2021年 | 1141篇 |
2020年 | 1229篇 |
2019年 | 1083篇 |
2018年 | 1010篇 |
2017年 | 1369篇 |
2016年 | 1353篇 |
2015年 | 1588篇 |
2014年 | 2241篇 |
2013年 | 2178篇 |
2012年 | 2680篇 |
2011年 | 2847篇 |
2010年 | 2157篇 |
2009年 | 2272篇 |
2008年 | 2206篇 |
2007年 | 2639篇 |
2006年 | 2231篇 |
2005年 | 2000篇 |
2004年 | 1732篇 |
2003年 | 1411篇 |
2002年 | 1204篇 |
2001年 | 1041篇 |
2000年 | 846篇 |
1999年 | 646篇 |
1998年 | 502篇 |
1997年 | 439篇 |
1996年 | 333篇 |
1995年 | 293篇 |
1994年 | 205篇 |
1993年 | 174篇 |
1992年 | 140篇 |
1991年 | 116篇 |
1990年 | 60篇 |
1989年 | 82篇 |
1988年 | 47篇 |
1987年 | 25篇 |
1986年 | 21篇 |
1985年 | 20篇 |
1984年 | 13篇 |
1983年 | 18篇 |
1982年 | 22篇 |
1981年 | 15篇 |
1980年 | 19篇 |
1979年 | 13篇 |
1978年 | 12篇 |
1977年 | 7篇 |
1976年 | 5篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
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. 相似文献
22.
This paper considers a novel distributed iterative learning consensus control algorithm based on neural networks for the control of heterogeneous nonlinear multiagent systems. The system's unknown nonlinear function is approximated by suitable neural networks; the approximation error is countered by a robust term in the control. Two types of control algorithms, both of which utilize distributed learning laws, are provided to achieve consensus. In the provided control algorithms, the desired reference is considered to be an unknown factor and then estimated using the associated learning laws. The consensus convergence is proven by the composite energy function method. A numerical simulation is ultimately presented to demonstrate the efficacy of the proposed control schemes. 相似文献
23.
Neural Machine Translation (NMT) is an end-to-end learning approach for
automated translation, overcoming the weaknesses of conventional phrase-based translation
systems. Although NMT based systems have gained their popularity in commercial
translation applications, there is still plenty of room for improvement. Being the most
popular search algorithm in NMT, beam search is vital to the translation result. However,
traditional beam search can produce duplicate or missing translation due to its target
sequence selection strategy. Aiming to alleviate this problem, this paper proposed neural
machine translation improvements based on a novel beam search evaluation function. And
we use reinforcement learning to train a translation evaluation system to select better
candidate words for generating translations. In the experiments, we conducted extensive
experiments to evaluate our methods. CASIA corpus and the 1,000,000 pairs of bilingual
corpora of NiuTrans are used in our experiments. The experiment results prove that the
proposed methods can effectively improve the English to Chinese translation quality. 相似文献
24.
25.
改进型UDP组播的性能分析及其在实时电源控制系统中的应用 总被引:1,自引:0,他引:1
文章通过采用带连接的UDP、I/O复用技术、关闭UDP校验和功能、负载均衡等技术对普通的UDP组播技术进行改进,使之在每个控制周期(1ms)内满足了分布式实时控制系统的实时性和可靠性要求。在将改进型的UDP组播技术应用于实际控制系统之前,文中构建了一个模拟局域网进行测试,对比结果表明改进后的组播技术无论在数据包延迟、丢包率等方面较改进前的UDP组播性能有较大幅度的提高。 相似文献
26.
基于mobile agent的分布式网络自管理模型 总被引:2,自引:1,他引:1
为了解决大规模、异构网络环境下基于“管理员密集”的传统网络管理模式带来的低效率和高出错率问题,提出了一种网络自管理模型,从网络管理的自动初始化和动态自管理两个方面实现对网络自动、自主、自适应的管理;提出了管理定位服务这一关键技术,在多个管理站协同工作的分布式网络环境中为设备自动定位出合适的管理站及初始的管理任务;采用可伸缩的分布式体系结构,适应了大规模网络的规模可变性等特点;基于mobile agent的管理框架进一步提高了管理的自适应性和灵活性。 相似文献
27.
针对炼油企业供水系统存在问题,阐述了炼油厂分散型水源井智能化集中监控的技术方案.对监控系统的硬件结构、程序设计、功能、技术特点和可靠性设计进行了较详细的介绍. 相似文献
28.
实时数据管理系统是流程企业控制信息网络与管理信息网络平滑集成的基础,为两者的数据通讯提供桥梁。介绍了笔者在炼油化工C企业IMS建设中的实时数据管理引擎设计与开发,具有其先进性与实用性。 相似文献
29.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
30.
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. 相似文献