全文获取类型
收费全文 | 17736篇 |
免费 | 2432篇 |
国内免费 | 1537篇 |
专业分类
电工技术 | 2731篇 |
技术理论 | 3篇 |
综合类 | 1974篇 |
化学工业 | 485篇 |
金属工艺 | 351篇 |
机械仪表 | 1991篇 |
建筑科学 | 2299篇 |
矿业工程 | 414篇 |
能源动力 | 307篇 |
轻工业 | 133篇 |
水利工程 | 396篇 |
石油天然气 | 396篇 |
武器工业 | 132篇 |
无线电 | 2021篇 |
一般工业技术 | 1084篇 |
冶金工业 | 266篇 |
原子能技术 | 117篇 |
自动化技术 | 6605篇 |
出版年
2024年 | 93篇 |
2023年 | 226篇 |
2022年 | 438篇 |
2021年 | 540篇 |
2020年 | 550篇 |
2019年 | 440篇 |
2018年 | 435篇 |
2017年 | 599篇 |
2016年 | 696篇 |
2015年 | 812篇 |
2014年 | 1140篇 |
2013年 | 1028篇 |
2012年 | 1456篇 |
2011年 | 1456篇 |
2010年 | 1092篇 |
2009年 | 1135篇 |
2008年 | 1157篇 |
2007年 | 1323篇 |
2006年 | 1069篇 |
2005年 | 1028篇 |
2004年 | 861篇 |
2003年 | 708篇 |
2002年 | 595篇 |
2001年 | 498篇 |
2000年 | 440篇 |
1999年 | 315篇 |
1998年 | 253篇 |
1997年 | 245篇 |
1996年 | 197篇 |
1995年 | 187篇 |
1994年 | 149篇 |
1993年 | 112篇 |
1992年 | 110篇 |
1991年 | 52篇 |
1990年 | 43篇 |
1989年 | 45篇 |
1988年 | 43篇 |
1987年 | 25篇 |
1986年 | 20篇 |
1985年 | 20篇 |
1984年 | 18篇 |
1983年 | 12篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1977年 | 4篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1973年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 11 毫秒
11.
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) 相似文献
12.
13.
广州中城广场工程结构形式复杂,平面曲折多角。施工中在应用多种模板体系、泵送混凝土、无粘结预应力楼板及核心筒部分小平台滑模等方面,采用了多项新技术,保证了工程质量,加快了工程进度。 相似文献
14.
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%). 相似文献
15.
With the growing size and complexity of power systems, system analysis—such as transients calculation—takes much time. Hence, fast calculation methods are required. Although parallel processing is a hopeful method, there have been difficulties in the parallel solution of linear equations which appear in power-flow calculations by the Newton-Raphson method. This paper aims at the fast calculation of the power-flow problem by means of parallel processing. In order to improve the suitability to the parallel solution of the differential equation in transients calculation, we assume the use of a direct-mapping parallel processing machine to map directly the network of a power system onto a network of processors. Under this assumption, we propose a new parallel-processing-oriented method in which the linear equation is solved by linear iterations between nodes with Aitken acceleration. We simulate the method on three model power systems and compare this Parallel Iterative Method (PIN) with a Parallel Direct Method (PDM) which uses the banded matrix according to the number of operations required. As a result, we can expect that PIM may solve linear equations faster than PDM with m processors, although the PIM might be inferior to the PDM with m × m processors, where m denotes the half-band width of the banded matrix. 相似文献
16.
Objective: Guided by the extended parallel process model (EPPM), the objective was to assess control processes dominant in influenza behavior decisions. Design: Cross-sectional survey. Results: Response rate was 31% (n=968). Regarding influenza risk, 59% were in danger control. Those in fear control were more likely to report influenza infection (p=.000). In the nonvaccinated, those in fear control were more likely to indicate not knowing where to get the vaccine (p=.016) and that it was unavailable (p=.027), and those in danger control believed they did not need it (p=.023). Zero critical values were more likely to indicate that no health provider recommended the shot (p=.002). Conclusions: Most perceived efficacy to be stronger than threat related to influenza; according to the EPPM, they are aware of their risk but recognize their ability to avert it. For those in danger control, messages should focus on increasing perceptions of severity and susceptibility to positively affect behavior change. For those in fear control, messages should focus on efficacy only. With a critical value of zero, no threat is induced, and a high-threat/high-efficacy approach should be taken. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
17.
通过一起由二次回路接线错误引发的事故分析,阐述二次回路的重要性。从设计、安装、调试和管理上对二次回路进行探讨,提出反事故措施和对策,以防止类似事故的发生。 相似文献
18.
洋葱路由技术在公网上提供双向、实时的匿名通信,其面向连接和严格的源路由方式导致效率低、扩展性差。利用分布式的概念,采用分段连接技术思想提出了一种安全、高效的分布式洋葱路由机制(DORS),给出了DORS路由实现算法,并从方案实现效率、安全性方面对DORS进行了分析。分析结果表明DORS具有良好的扩展性、鲁棒性、简单性和有效性。 相似文献
19.
Andrzej Ciepielewski 《International journal of parallel programming》1991,20(6):421-451
Implementation of or-parallel Prolog systems offers a number of interesting scheduling problems. The main issues are the interaction between memory models and scheduling, ordering of multiple solutions, and scheduling of speculative work. The problems occur partly because of the design choices (e.g. the choice of a memory model), and partly because of the desire to maintain observational equivalence between parallel and sequential implementations of Prolog, while achieving high efficiency. In the first part of this paper a common framework for discussing scheduling in or-parallel systems is introduced, and also a collection of issues that must be addressed in such systems is presented. In the second part of the paper we survey a number of solutions to these problems comparing their efficiency whenever possible. We close the survey with a short discussion of open problems.Current association: Carlstedt Elektronik AB 相似文献
20.
Due to interference, path loss, multipath fading, background noise, and many other factors, wireless communication normally
cannot provide a wireless link with both a high data rate and a long transmission range. To address this problem, striping
network traffic in parallel over multiple lower-data-rate but longer-transmission-range wireless channels may be used. In
this paper, we propose a new striping method and evaluate its performances over multiple IEEE 802.11(b) channels under various
conditions. Our extensive simulation results show that this method is quite effective for such an application.
S.Y. Wang is an Associate Professor of the Department of Computer Science and Information Engineering at National Chiao Tung University,
Taiwan. He received his Master and Ph.D. degree in computer science from Harvard University in 1997 and 1999, respectively.
His research interests include wireless networks, Internet technologies, network simulations, and operating systems. He is
the author of the NCTUns 2.0 network simulator and emulator, which is being widely used by network and communication researchers.
More information about the tool is available at http://NSL.csie.nctu.edu.tw/nctuns.html.
C.H. Hwang received his master degree in computer science from NCTU in 2002 and currently is working for a network company.
C.L. Chou currently is a third-year Ph.D. student at the Department of Computer Science and Information Engineering, National Chiao
TungUniversity (NCTU), Taiwan. He received his master degree in computer science from NCTU in 2002. 相似文献