全文获取类型
收费全文 | 16591篇 |
免费 | 2322篇 |
国内免费 | 1676篇 |
专业分类
电工技术 | 1846篇 |
技术理论 | 3篇 |
综合类 | 1942篇 |
化学工业 | 706篇 |
金属工艺 | 666篇 |
机械仪表 | 2918篇 |
建筑科学 | 605篇 |
矿业工程 | 335篇 |
能源动力 | 243篇 |
轻工业 | 172篇 |
水利工程 | 181篇 |
石油天然气 | 366篇 |
武器工业 | 218篇 |
无线电 | 1882篇 |
一般工业技术 | 1317篇 |
冶金工业 | 258篇 |
原子能技术 | 175篇 |
自动化技术 | 6756篇 |
出版年
2024年 | 89篇 |
2023年 | 242篇 |
2022年 | 377篇 |
2021年 | 510篇 |
2020年 | 500篇 |
2019年 | 440篇 |
2018年 | 463篇 |
2017年 | 630篇 |
2016年 | 696篇 |
2015年 | 789篇 |
2014年 | 1074篇 |
2013年 | 1062篇 |
2012年 | 1332篇 |
2011年 | 1314篇 |
2010年 | 919篇 |
2009年 | 1034篇 |
2008年 | 964篇 |
2007年 | 1173篇 |
2006年 | 1034篇 |
2005年 | 922篇 |
2004年 | 801篇 |
2003年 | 677篇 |
2002年 | 572篇 |
2001年 | 498篇 |
2000年 | 419篇 |
1999年 | 320篇 |
1998年 | 267篇 |
1997年 | 274篇 |
1996年 | 192篇 |
1995年 | 202篇 |
1994年 | 179篇 |
1993年 | 128篇 |
1992年 | 128篇 |
1991年 | 57篇 |
1990年 | 62篇 |
1989年 | 56篇 |
1988年 | 55篇 |
1987年 | 28篇 |
1986年 | 17篇 |
1985年 | 20篇 |
1984年 | 18篇 |
1983年 | 10篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 8篇 |
1979年 | 6篇 |
1977年 | 4篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1973年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
In this paper, we study scheduling games under mixed coordination mechanisms on hierarchical machines. The two scheduling policies involved are ‐ and ‐, where ‐ (resp., ‐) policy sequences jobs in nondecreasing order of their hierarchies, and jobs of the same hierarchy in nonincreasing (resp., nondecreasing) order of their processing times. We first show the existence of a Nash equilibrium. Then we present the price of anarchy and the price of stability for the games with social costs of minimizing the makespan and maximizing the minimum machine load. All the bounds given in this paper are tight. 相似文献
2.
3.
串行和并行接口模式是A/D转换器诸多分类中的一种,但却是应用中器件选择的一个重要指标.在同样的转换分辨率及转换速度的前提下,不同的接口方式不但影响了电路结构,更重要的是将在高速数据采集的过程中对采样周期产生较大影响.本文通过12位串行ADC ADS7822和并行ADC ADS774与AT89C51的接口电路,给出二者采样时间的差异性. 相似文献
4.
可并联逆变器中的同步控制技术及其实现 总被引:5,自引:2,他引:3
论述了可并联逆变器中的同步控制技术及其实现方法。在分析了同步的重要性之后,提出了抢占与并发相结合的同步控制策略及其实现方法,实践证明该方法具有很高的控制精度。 相似文献
5.
Steven Y. Susswein Thomas C. Henderson Joseph L. Zachary Chuck Hansen Paul Hinker Gary C. Marsden 《International journal of parallel programming》1991,20(6):453-473
Filtering algorithms are well accepted as a means of speeding up the solution of the consistent labeling problem (CLP). Despite the fact that path consistency does a better job of filtering than arc consistency, AC is still the preferred technique because it has a much lower time complexity. We are implementing parallel path consistency algorithms on multiprocessors and comparing their performance to the best sequential and parallel arc consistency algorithms.(1,2) (See also work by Kerethoet al.
(3) and Kasif(4)) Preliminary work has shown linear performance increases for parallelized path consistency and also shown that in many cases performance is significantly better than the theoretical worst case. These two results lead us to believe that parallel path consistency may be a superior filtering technique. Finally, we have implemented path consistency as an outer product computation and have obtained good results (e.g., linear speedup on a 64K-node Connection Machine 2). 相似文献
6.
7.
8.
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) 相似文献
9.
10.
F. Pasquarelli 《Journal of scientific computing》1995,10(3):289-304
The multidomain technique for elliptic problems, that allows the fulfillment of the interface conditions by means of a suitable combination of the continuity of the solution and of its normal derivative, is considered. Some choices of this combination are investigated and, in particular, a choice that allows the solution of the multidomain problem through two solutions for each subproblem, is proposed. The scheme has been discretized with a collocation method and some numerical tests are reported. Moreover the method is compared with the more classical Dirichlet/Neumann one as well as with the capacitance matrix method.This research has been supported by a grant from M.P.I. (40%). 相似文献