全文获取类型
收费全文 | 12553篇 |
免费 | 1565篇 |
国内免费 | 1289篇 |
专业分类
电工技术 | 995篇 |
综合类 | 1007篇 |
化学工业 | 250篇 |
金属工艺 | 309篇 |
机械仪表 | 803篇 |
建筑科学 | 346篇 |
矿业工程 | 104篇 |
能源动力 | 364篇 |
轻工业 | 93篇 |
水利工程 | 97篇 |
石油天然气 | 112篇 |
武器工业 | 139篇 |
无线电 | 1476篇 |
一般工业技术 | 1063篇 |
冶金工业 | 361篇 |
原子能技术 | 35篇 |
自动化技术 | 7853篇 |
出版年
2024年 | 102篇 |
2023年 | 227篇 |
2022年 | 343篇 |
2021年 | 353篇 |
2020年 | 405篇 |
2019年 | 386篇 |
2018年 | 363篇 |
2017年 | 535篇 |
2016年 | 555篇 |
2015年 | 685篇 |
2014年 | 853篇 |
2013年 | 993篇 |
2012年 | 973篇 |
2011年 | 1052篇 |
2010年 | 763篇 |
2009年 | 861篇 |
2008年 | 905篇 |
2007年 | 889篇 |
2006年 | 742篇 |
2005年 | 617篇 |
2004年 | 478篇 |
2003年 | 403篇 |
2002年 | 352篇 |
2001年 | 278篇 |
2000年 | 230篇 |
1999年 | 160篇 |
1998年 | 145篇 |
1997年 | 121篇 |
1996年 | 99篇 |
1995年 | 92篇 |
1994年 | 69篇 |
1993年 | 68篇 |
1992年 | 50篇 |
1991年 | 39篇 |
1990年 | 26篇 |
1989年 | 34篇 |
1988年 | 20篇 |
1987年 | 16篇 |
1986年 | 11篇 |
1985年 | 13篇 |
1984年 | 4篇 |
1983年 | 12篇 |
1982年 | 17篇 |
1981年 | 13篇 |
1980年 | 13篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
带关键字搜索的公钥加密(PEKS)是一种有用的加密原语,它允许用户将在加密数据上搜索的功能委托给不可信的第三方服务器,而不影响原始数据的安全性和隐私性。但是,由于缺乏对于数据的加密以及解密能力,PEKS方案不能单独进行使用,必须与标准的公钥加密方案(PKE)相结合。因此,Baek等人在2006年引入了一种新的加密原语,称为结合PKE和PEKS的加密方案(PKE+PEKS),它同时提供了PKE和PEKS的功能。目前,已有文献提出了几种PKE+PEKS方案。然而,他们都没有考虑关键字猜测攻击的问题。本文提出一个新的高效且能够抵抗关键字猜测攻击的PKE+PEKS方案,与已有方案相比,该方案在性能上有很大的提升,并且在生成关键字和数据密文时,不需要使用双线性对,极大地降低了计算和存储成本。安全性分析表明,本文中所提出的方案能够满足密文隐私安全性、陷门不可区分性和抗关键字猜测攻击的安全性。效率分析表明,本分提出的方案更加高效。 相似文献
2.
3.
陈国龙 《计算机辅助设计与图形学学报》1994,6(2):136-142
本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念,通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法,但有较传统线探索法更强的探索能力,不需要结合李氏算法而能单独完成布线任务,是一种较理想的算法,通过实验获得了较为满意的效果。 相似文献
4.
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%. 相似文献
5.
2005年11月份邯郸钢铁厂8万煤气柜外送煤气加压机采用高压变频技术改造。其原因是该加压机外送量波动较大,采用普通阀门调节打回流,将会浪费大量电能,采用变频技术改造后,节能效果非常明显。 相似文献
6.
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) 相似文献
7.
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) 相似文献
8.
New technologies such as power electronics have made it possible to change continuously the impedance of a power system not only to control power flow but also to enhance stability. A power system incorporating a variable impedance apparatus such as a variable series capacitor (VSrC) and high-speed phase shifter (HSPS) is called VIPS (Variable Impedance Power System) by the authors. This paper proposes a novel control method of VIPS apparatus such as VSrC and HSPS installed at an interconnecting point for stabilizing inter-area unstable and/or oscillatory modes. The proposed design method of the control system is a kind of hierarchical decentralized control method of a large-scale power system based on a Lyapunov function. Under the proposed control scheme, each subsystem can be stabilized independently by local controllers such as AVR, speed governor and PSS, and then the whole interconnected system can be stabilized by VIPS apparatus taking into account interactions between subsystems. The effectiveness and robustness of the VIPS apparatus control are shown by numerical examples with model systems including a large-scale power system. 相似文献
9.
中针对变井储试井分析问题,给出了确定变井储系数及计算续流量的方法,并用反褶积分析积分析方法解释了未出现径向流的早期测压数据,给出了解决早期试井资料分析问题的有效方法。 相似文献
10.
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. 相似文献