全文获取类型
收费全文 | 14386篇 |
免费 | 2507篇 |
国内免费 | 1655篇 |
学科分类
工业技术 | 18548篇 |
出版年
2024年 | 128篇 |
2023年 | 285篇 |
2022年 | 469篇 |
2021年 | 550篇 |
2020年 | 611篇 |
2019年 | 529篇 |
2018年 | 457篇 |
2017年 | 618篇 |
2016年 | 637篇 |
2015年 | 744篇 |
2014年 | 1037篇 |
2013年 | 927篇 |
2012年 | 1099篇 |
2011年 | 994篇 |
2010年 | 830篇 |
2009年 | 889篇 |
2008年 | 964篇 |
2007年 | 1082篇 |
2006年 | 835篇 |
2005年 | 887篇 |
2004年 | 788篇 |
2003年 | 647篇 |
2002年 | 560篇 |
2001年 | 447篇 |
2000年 | 330篇 |
1999年 | 273篇 |
1998年 | 195篇 |
1997年 | 144篇 |
1996年 | 129篇 |
1995年 | 121篇 |
1994年 | 92篇 |
1993年 | 56篇 |
1992年 | 44篇 |
1991年 | 31篇 |
1990年 | 18篇 |
1989年 | 13篇 |
1988年 | 15篇 |
1987年 | 8篇 |
1986年 | 10篇 |
1985年 | 11篇 |
1984年 | 7篇 |
1983年 | 7篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 7篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1977年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
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.
3.
Javier Ramírez Antonio García Uwe Meyer-Bäse Fred Taylor Antonio Lloris 《The Journal of VLSI Signal Processing》2003,33(1-2):171-190
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.
5.
一种新的线性分布参数系统辨识方法 总被引:1,自引:0,他引:1
本文应用块脉冲函数(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.
Shu‐Li Sun Jing Ma Nan Lv 《International Journal of Adaptive Control and Signal Processing》2008,22(10):932-948
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. 相似文献
9.
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. 相似文献
10.