全文获取类型
收费全文 | 31014篇 |
免费 | 3278篇 |
国内免费 | 2492篇 |
专业分类
电工技术 | 2083篇 |
技术理论 | 1篇 |
综合类 | 3259篇 |
化学工业 | 1709篇 |
金属工艺 | 410篇 |
机械仪表 | 1049篇 |
建筑科学 | 1796篇 |
矿业工程 | 319篇 |
能源动力 | 545篇 |
轻工业 | 477篇 |
水利工程 | 339篇 |
石油天然气 | 280篇 |
武器工业 | 175篇 |
无线电 | 6289篇 |
一般工业技术 | 1774篇 |
冶金工业 | 473篇 |
原子能技术 | 75篇 |
自动化技术 | 15731篇 |
出版年
2024年 | 119篇 |
2023年 | 467篇 |
2022年 | 595篇 |
2021年 | 698篇 |
2020年 | 856篇 |
2019年 | 758篇 |
2018年 | 697篇 |
2017年 | 922篇 |
2016年 | 1118篇 |
2015年 | 1265篇 |
2014年 | 1834篇 |
2013年 | 2011篇 |
2012年 | 1988篇 |
2011年 | 2241篇 |
2010年 | 1780篇 |
2009年 | 2158篇 |
2008年 | 2255篇 |
2007年 | 2319篇 |
2006年 | 1856篇 |
2005年 | 1610篇 |
2004年 | 1376篇 |
2003年 | 1232篇 |
2002年 | 1118篇 |
2001年 | 959篇 |
2000年 | 919篇 |
1999年 | 718篇 |
1998年 | 589篇 |
1997年 | 517篇 |
1996年 | 410篇 |
1995年 | 306篇 |
1994年 | 243篇 |
1993年 | 186篇 |
1992年 | 149篇 |
1991年 | 95篇 |
1990年 | 72篇 |
1989年 | 57篇 |
1988年 | 49篇 |
1987年 | 24篇 |
1986年 | 20篇 |
1985年 | 45篇 |
1984年 | 41篇 |
1983年 | 37篇 |
1982年 | 43篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1979年 | 8篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
31.
基于交会图和多元统计法的神经网络技术在火山岩识别中的应用 总被引:10,自引:2,他引:8
针对火山岩储层的特殊性(复杂性、离散性和随机性),应用BP神经网络技术对火山岩测井解释中岩性识别问题进行了研究。该方法的技术关键是样本集和初始权重的建立,以及模型的优选。本文提出了一种基于交会图和多元统计法的学习样本生成方法,即根据取心岩样的地球化学和岩石学研究,用交会图技术建立样本集,采用聚类分析和距离判别法确定初始权重。将研究方法应用在松辽盆地杏山地区火山岩岩性识别问题中,取得了很好的效果,岩性解释符合率高于90%。文中通过四种岩性识别处理模式的对比研究,表明赋权重处理模式为最优处理模型。在神经网络模型预测过程中,需充分利用已有的地质经验和测井曲线信息建立典型可靠的样本文件,同时考虑神经网络方法中各种因素的影响,优选模型和计算参数才能使预测结果符合实际情况。 相似文献
32.
33.
实时数据管理系统是流程企业控制信息网络与管理信息网络平滑集成的基础,为两者的数据通讯提供桥梁。介绍了笔者在炼油化工C企业IMS建设中的实时数据管理引擎设计与开发,具有其先进性与实用性。 相似文献
34.
35.
Kicheon Kim 《ETRI Journal》2006,28(1):31-44
In a packet switching network, congestion is unavoidable and affects the quality of real‐time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well‐known solutions for quality‐of‐service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network. 相似文献
36.
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. 相似文献
37.
38.
39.
Christian Stephan Bernd 《AEUE-International Journal of Electronics and Communications》2006,60(1):20-24
Security for ad hoc network environments has received a lot of attention as of today. Previous work has mainly been focussing on secure routing, fairness issues, and malicious node detection. However, the issue of introducing and conserving trust relationships has received considerably less attention. In this article, we present a scalable method for the use of public key certificates and their revocation in mobile ad hoc networks (MANETs). With the LKN-ad hoc security framework (LKN-ASF) a certificate management protocol has been introduced, bringing PKI technology to MANETs. In addition a performance analysis of two different revocation approaches for MANETs will be presented. 相似文献
40.