全文获取类型
收费全文 | 12950篇 |
免费 | 2149篇 |
国内免费 | 1616篇 |
专业分类
电工技术 | 1691篇 |
综合类 | 1239篇 |
化学工业 | 330篇 |
金属工艺 | 236篇 |
机械仪表 | 557篇 |
建筑科学 | 484篇 |
矿业工程 | 217篇 |
能源动力 | 353篇 |
轻工业 | 157篇 |
水利工程 | 378篇 |
石油天然气 | 179篇 |
武器工业 | 157篇 |
无线电 | 1753篇 |
一般工业技术 | 1090篇 |
冶金工业 | 434篇 |
原子能技术 | 170篇 |
自动化技术 | 7290篇 |
出版年
2024年 | 126篇 |
2023年 | 288篇 |
2022年 | 524篇 |
2021年 | 509篇 |
2020年 | 534篇 |
2019年 | 490篇 |
2018年 | 465篇 |
2017年 | 635篇 |
2016年 | 656篇 |
2015年 | 750篇 |
2014年 | 953篇 |
2013年 | 1061篇 |
2012年 | 1060篇 |
2011年 | 1091篇 |
2010年 | 803篇 |
2009年 | 850篇 |
2008年 | 906篇 |
2007年 | 895篇 |
2006年 | 720篇 |
2005年 | 617篇 |
2004年 | 479篇 |
2003年 | 383篇 |
2002年 | 328篇 |
2001年 | 305篇 |
2000年 | 244篇 |
1999年 | 165篇 |
1998年 | 124篇 |
1997年 | 125篇 |
1996年 | 99篇 |
1995年 | 87篇 |
1994年 | 64篇 |
1993年 | 60篇 |
1992年 | 53篇 |
1991年 | 38篇 |
1990年 | 28篇 |
1989年 | 30篇 |
1988年 | 24篇 |
1987年 | 16篇 |
1986年 | 19篇 |
1985年 | 11篇 |
1984年 | 7篇 |
1983年 | 12篇 |
1982年 | 16篇 |
1981年 | 11篇 |
1980年 | 11篇 |
1979年 | 9篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 6篇 |
1975年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
11.
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. 相似文献
12.
13.
陈国龙 《计算机辅助设计与图形学学报》1994,6(2):136-142
本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念,通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法,但有较传统线探索法更强的探索能力,不需要结合李氏算法而能单独完成布线任务,是一种较理想的算法,通过实验获得了较为满意的效果。 相似文献
14.
油田污水中咪唑啉缓蚀剂浓度检测技术研究 总被引:5,自引:0,他引:5
研究评价了油田污水中咪唑啉缓蚀剂浓度检测的七种方法 ,其中紫外光分析法和显色反应法适合于低浓度咪唑啉缓蚀剂检测 ,且方法简便、速度快、成本低 ,检测浓度范围 2~ 5 0mg/L。 相似文献
15.
An efficient algorithm for the random packing of spheres can significantly save the cost of the preparation of an initial configuration often required in discrete element simulations. It is not trivial to generate such random packing at a large scale, particularly when spheres of various sizes and geometric domains of different shapes are present. Motivated by the idea of compression complemented by an efficient physical process to increase packing density, shaking, a new approach, termed compression algorithm, is proposed in this work to randomly fill any arbitrary polyhedral or cylindrical domains with spheres of various sizes. The algorithm features both simplicity and high efficiency. Tests show that it takes 181 s on a 1.4-GHz PC to complete the filling of a cylindrical domain with a total number of 26,787 spheres, achieving a packing density of 52.89%. 相似文献
16.
Seog Geun Kang 《ETRI Journal》2006,28(2):235-238
In this letter, a block code that minimizes the peak‐to‐average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals is proposed. It is shown that peak envelope power is invariant to cyclic shift and codeword inversion. The systematic encoding rule for the proposed code is composed of searching for a seed codeword, shifting the register elements, and determining codeword inversion. This eliminates the look‐up table for one‐to‐one correspondence between the source and the coded data. Computer simulation confirms that OFDM systems with the proposed code always have the minimum PAPR. 相似文献
17.
Across 2 experiments, a new experimental procedure was used to investigate attentional capture by animal fear-relevant stimuli. In Experiment 1 (N = 34), unselected participants were slower to detect a neutral target animal in the presence of a spider than a cockroach distractor and in the presence of a snake than a large lizard distractor. This result confirms that phylogenetically fear-relevant animals capture attention specifically and to a larger extent than do non-fear-relevant animals. In Experiment 2 (N = 86), detection of a neutral target animal was slowed more in the presence of a feared fear-relevant distractor (e.g., a snake for snake-fearful participants) than in presence of a not-feared fear-relevant distractor (e.g., a spider for snake-fearful participants). These results indicate preferential attentional capture that is specific to phylogenetically fear-relevant stimuli and is selectively enhanced in individuals who fear these animals. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
18.
This study examined whether objects are attended in serial or in parallel during a demanding visual search task. A component of the event-related potential waveform, the N2pc wave, was used as a continuous measure of the allocation of attention to possible targets in the search arrays. Experiment 1 demonstrated that the relative allocation of attention shifts rapidly, favoring one item and then another. In Experiment 2, a paradigm was used that made it possible to track the absolute allocation of attention to individual items. This experiment showed that attention was allocated to one object for 100-150 ms before attention began to be allocated to the next object. These findings support models of attention that posit serial processing in demanding visual search tasks. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
19.
20.
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n
2
log
n) toO(n log2
n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296. 相似文献