首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   14444篇
  免费   2637篇
  国内免费   1850篇
电工技术   4021篇
综合类   1450篇
化学工业   259篇
金属工艺   68篇
机械仪表   582篇
建筑科学   350篇
矿业工程   155篇
能源动力   512篇
轻工业   83篇
水利工程   318篇
石油天然气   116篇
武器工业   130篇
无线电   2263篇
一般工业技术   534篇
冶金工业   142篇
原子能技术   56篇
自动化技术   7892篇
  2024年   155篇
  2023年   355篇
  2022年   537篇
  2021年   652篇
  2020年   708篇
  2019年   599篇
  2018年   545篇
  2017年   694篇
  2016年   714篇
  2015年   782篇
  2014年   1092篇
  2013年   1055篇
  2012年   1102篇
  2011年   987篇
  2010年   828篇
  2009年   855篇
  2008年   916篇
  2007年   1025篇
  2006年   790篇
  2005年   829篇
  2004年   730篇
  2003年   587篇
  2002年   495篇
  2001年   402篇
  2000年   298篇
  1999年   260篇
  1998年   191篇
  1997年   140篇
  1996年   129篇
  1995年   124篇
  1994年   94篇
  1993年   59篇
  1992年   45篇
  1991年   32篇
  1990年   19篇
  1989年   14篇
  1988年   16篇
  1987年   10篇
  1986年   11篇
  1985年   10篇
  1984年   6篇
  1983年   6篇
  1982年   5篇
  1981年   4篇
  1980年   7篇
  1979年   6篇
  1978年   5篇
  1977年   3篇
  1959年   1篇
  1957年   1篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
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.  相似文献   
2.
分布式无线传感器网络通信协议研究   总被引:64,自引:2,他引:62  
于海斌  曾鹏  王忠锋  梁英  尚志军 《通信学报》2004,25(10):102-110
在归纳分布式无线传感器网络研究进展的基础上,给出了综合分布式无线传感器网络技术各个方面的协议体系结构,并在新的体系结构下,系统地阐述了分布式无线传感器网络通信协议研究的进展,介绍了典型的应用案例和国外相关计划的研究情况。最后,指明了这一处于发展初期的研究领域的未来发展方向。  相似文献   
3.
Currently there are design barriers inhibiting the implementation of high-precision digital signal processing (DSP) objects with field programmable logic (FPL) devices. This paper explores overcoming these barriers by fusing together the popular distributed arithmetic (DA) method with the residue number system (RNS) for use in FPL-centric designs. The new design paradigm is studied in the context of a high-performance filter bank and a discrete wavelet transform (DWT). The proposed design paradigm is facilitated by a new RNS accumulator structure based on a carry save adder (CSA). The reported methodology also introduces a polyphase filter structure that results in a reduced look-up table (LUT) budget. The 2C-DA and RNS-DA are compared, in the context of a FPL implementation strategy, using a discrete wavelet transform (DWT) filter bank as a common design theme. The results show that the RNS-DA, compared to a traditional 2C-DA design, enjoys a performance advantage that increases with precision (wordlength).  相似文献   
4.
介绍了在波分复用(WDM)系统中分布式光纤拉曼放大器(FRA)的理论分析模型。在此基础上,对增益平坦设计所需考虑的因素进行了分析;最后通过试验证明了它的有效性。  相似文献   
5.
一种新的线性分布参数系统辨识方法   总被引:1,自引:0,他引:1  
檀国节 《信息与控制》1994,23(4):212-214,222
本文应用块脉冲函数(BPF)将含有未知参数的线性分布参数系统偏微分方程转换为矩阵方程,通过最小二乘法辨识线性分布参数系统的参数,辨识结果表明,BPF辨识法具有原理简捷,实现方便,辨识精度高等优点。  相似文献   
6.
The requirements on an object-oriented DBMS for management of information in a large, complex enterprise are presented. These requirements aid in the achievement of an environment characterized by data sharing, open architectures, application and data portability, and assurance of data integrity. They were defined from the point of view of a user of the DBMS; therefore they describe the expected functionality of the DBMS and do not specify the method of implementation to achieve this functionality. They encompass requirements on the data model, query and data manipulation languages, the system architecure, interfaces to the system, change management, and transaction management.  相似文献   
7.
随着电容测量技术的迅速发展,电容传感器在非电量测量和自动检测中得到广泛应用,但它在使用过程中也存在一些问题,针对在使用电容传感器过程中存在的几个问题,从电容传感器的原理和工作过程两个方面进行了讨论,并提出行之有效的处理方法。  相似文献   
8.
In this paper, we discuss average consensus problem in undirected networks of dynamic agents with fixed and switching topologies as well as multiple time-varying communication delays. By employing a linear matrix inequality method, we prove that all the nodes in the network achieve average consensus asymptotically for appropriate communication delays if the network topology is connected. Particularly, several feasible linear matrix inequalities are established to determine the maximal allowable upper bound of time-varying communication delays. Numerical examples are given to demonstrate the effectiveness and the sharpness of the theoretical results.  相似文献   
9.
Based on the optimal fusion estimation algorithm weighted by scalars in the linear minimum variance sense, a distributed optimal fusion Kalman filter weighted by scalars is presented for discrete‐time stochastic singular systems with multiple sensors and correlated noises. A cross‐covariance matrix of filtering errors between any two sensors is derived. When the noise statistical information is unknown, a distributed identification approach is presented based on correlation functions and the weighted average method. Further, a distributed self‐tuning fusion filter is given, which includes two stage fusions where the first‐stage fusion is used to identify the noise covariance and the second‐stage fusion is used to obtain the fusion state filter. A simulation verifies the effectiveness of the proposed algorithm. Copyright © 2008 John Wiley & Sons, Ltd.  相似文献   
10.
In executing tasks involving intelligent information processing, the human brain performs better than the digital computer. The human brain derives its power from a large number [O(1011)] of neurons which are interconnected by a dense interconnection network [O(105) connections per neuron]. Artificial neural network (ANN) paradigms adopt the structure of the brain to try to emulate the intelligent information processing methods of the brain. ANN techniques are being employed to solve problems in areas such as pattern recognition, and robotic processing. Simulation of ANNs involves implementation of large number of neurons and a massive interconnection network. In this paper, we discuss various simulation models of ANNs and their implementation on distributed memory systems. Our investigations reveal that communication-efficient networks of distributed memory systems perform better than other topologies in implementing ANNs.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号