全文获取类型
收费全文 | 187299篇 |
免费 | 16029篇 |
国内免费 | 12137篇 |
专业分类
电工技术 | 30436篇 |
技术理论 | 10篇 |
综合类 | 17537篇 |
化学工业 | 9272篇 |
金属工艺 | 6924篇 |
机械仪表 | 17278篇 |
建筑科学 | 15262篇 |
矿业工程 | 7249篇 |
能源动力 | 4943篇 |
轻工业 | 4651篇 |
水利工程 | 5536篇 |
石油天然气 | 5770篇 |
武器工业 | 2815篇 |
无线电 | 14637篇 |
一般工业技术 | 8532篇 |
冶金工业 | 7669篇 |
原子能技术 | 1268篇 |
自动化技术 | 55676篇 |
出版年
2024年 | 591篇 |
2023年 | 1907篇 |
2022年 | 3184篇 |
2021年 | 4025篇 |
2020年 | 4819篇 |
2019年 | 3880篇 |
2018年 | 3432篇 |
2017年 | 5109篇 |
2016年 | 5766篇 |
2015年 | 6468篇 |
2014年 | 12284篇 |
2013年 | 10714篇 |
2012年 | 13379篇 |
2011年 | 14477篇 |
2010年 | 10980篇 |
2009年 | 11444篇 |
2008年 | 11501篇 |
2007年 | 14055篇 |
2006年 | 12676篇 |
2005年 | 11084篇 |
2004年 | 9187篇 |
2003年 | 8128篇 |
2002年 | 6536篇 |
2001年 | 5439篇 |
2000年 | 4681篇 |
1999年 | 3838篇 |
1998年 | 2976篇 |
1997年 | 2635篇 |
1996年 | 2086篇 |
1995年 | 1706篇 |
1994年 | 1467篇 |
1993年 | 1048篇 |
1992年 | 838篇 |
1991年 | 636篇 |
1990年 | 471篇 |
1989年 | 419篇 |
1988年 | 300篇 |
1987年 | 177篇 |
1986年 | 136篇 |
1985年 | 137篇 |
1984年 | 169篇 |
1983年 | 136篇 |
1982年 | 122篇 |
1981年 | 86篇 |
1980年 | 58篇 |
1979年 | 66篇 |
1978年 | 52篇 |
1977年 | 51篇 |
1964年 | 13篇 |
1959年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
111.
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. 相似文献
112.
Ratnabali Biswas Kaushik Chowdhury Dharma P. Agrawal 《International Journal of Wireless Information Networks》2006,13(4):303-315
Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes. 相似文献
113.
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. 相似文献
114.
In this paper, a new approach for fault detection and isolation that is based on the possibilistic clustering algorithm is proposed. Fault detection and isolation (FDI) is shown here to be a pattern classification problem, which can be solved using clustering and classification techniques. A possibilistic clustering based approach is proposed here to address some of the shortcomings of the fuzzy c-means (FCM) algorithm. The probabilistic constraint imposed on the membership value in the FCM algorithm is relaxed in the possibilistic clustering algorithm. Because of this relaxation, the possibilistic approach is shown in this paper to give more consistent results in the context of the FDI tasks. The possibilistic clustering approach has also been used to detect novel fault scenarios, for which the data was not available while training. Fault signatures that change as a function of the fault intensities are represented as fault lines, which have been shown to be useful to classify faults that can manifest with different intensities. The proposed approach has been validated here through simulations involving a benchmark quadruple tank process and also through experimental case studies on the same setup. For large scale systems, it is proposed to use the possibilistic clustering based approach in the lower dimensional approximations generated by algorithms such as PCA. Towards this end, finally, we also demonstrate the key merits of the algorithm for plant wide monitoring study using a simulation of the benchmark Tennessee Eastman problem. 相似文献
115.
Entomopathogenic nematodes (Nematoda: Heterorhabditidae and Steinernematidae) are commonly used biological control agents of insects in cryptic habitats, but their potential for suppressing stored-product insects in these habitats has not been explored previously. Here, we provide data from the first step in a program to evaluate entomopathogenic nematodes in the genus Steinernema as biological control agents of stored-product pests by determining their pathogenicity to some of the major stored-product pest species. When evaluated against larvae, pupae and adults of six pest species (Plodia interpunctella, Ephestia kuehniella, Oryzaephilus surinamensis, Tenebrio molitor, Tribolium castaneum, and Trogoderma variabile), and the adults of two additional pest species (Sitophilus oryzae and Rhyzopertha dominica), Steinernema riobrave was either the most pathogenic or of similar pathogenicity compared to S. carpocapsae and S. feltiae. A dose of 10 infective juveniles of S. riobrave caused 80% or higher mortality against larvae of P. interpunctella, E. kuehniella, T. castaneum, and O. surinamensis, pupae of T. castaneum and T. molitor, and adults of T. molitor and the two moth species. All stages of Trogoderma variabile exhibited 70% or higher mortality. Adults of S. oryzae and R. dominica exhibited low susceptibility with 15% and 35% mortality, respectively. On the basis of these results, S. riobrave was selected for further evaluation under more field-like conditions. 相似文献
116.
质量控制图系统的实现及在SMT中的应用 总被引:1,自引:0,他引:1
本文将控制图理论与计算机技术相结合,开发了质量控制图系统.介绍了该系统的设计方案和关键技术问题,并以电子产品制造中监控SMT机的焊膏厚度为例说明了系统的应用. 相似文献
117.
2.4GHz动态CMOS分频器的设计 总被引:1,自引:0,他引:1
对现阶段的主流高速CMOS分频器进行分析和比较,在此基础上设计一种采用TSPC(truesingle phase clock)和E-TSPC(extended TSPC)技术的前置双模分频器电路.该分频器大大提高了工作频率,采用0.6μm CMOS工艺参数进行仿真的结果表明,在5V电源电压下,最高频率达到3GHz,功耗仅为8mW. 相似文献
118.
某雷达数据处理有关问题分析 总被引:1,自引:0,他引:1
对某雷达数据处理应用中存在的一些特殊问题进行讨论分析,并就具体问题提出了解决的方法. 相似文献
119.
论文比较详细地阐述了涉密网主机系统所面临的安全隐患,提出了涉密网主机安全防护所要解决的几个技术问题,并就可能实现的技术方法进行了探讨和比较。 相似文献
120.
文章针对使用USB存储设备造成的内部泄密问题,提出了一种USB存储设备访问控制方案,该方案对用户的身份认证基于安全强度很高的椭圆曲线数字签名算法,同时使用过滤器驱动程序实现了USB存储设备的读写控制,因而此方案具有较好的安全性、实用性和通用性。 相似文献