全文获取类型
收费全文 | 9429篇 |
免费 | 1062篇 |
国内免费 | 805篇 |
专业分类
电工技术 | 853篇 |
技术理论 | 1篇 |
综合类 | 896篇 |
化学工业 | 163篇 |
金属工艺 | 64篇 |
机械仪表 | 368篇 |
建筑科学 | 519篇 |
矿业工程 | 280篇 |
能源动力 | 303篇 |
轻工业 | 63篇 |
水利工程 | 698篇 |
石油天然气 | 229篇 |
武器工业 | 81篇 |
无线电 | 2185篇 |
一般工业技术 | 475篇 |
冶金工业 | 201篇 |
原子能技术 | 8篇 |
自动化技术 | 3909篇 |
出版年
2024年 | 85篇 |
2023年 | 195篇 |
2022年 | 271篇 |
2021年 | 340篇 |
2020年 | 349篇 |
2019年 | 316篇 |
2018年 | 301篇 |
2017年 | 379篇 |
2016年 | 427篇 |
2015年 | 488篇 |
2014年 | 701篇 |
2013年 | 708篇 |
2012年 | 732篇 |
2011年 | 788篇 |
2010年 | 551篇 |
2009年 | 573篇 |
2008年 | 592篇 |
2007年 | 643篇 |
2006年 | 529篇 |
2005年 | 469篇 |
2004年 | 349篇 |
2003年 | 344篇 |
2002年 | 221篇 |
2001年 | 168篇 |
2000年 | 152篇 |
1999年 | 94篇 |
1998年 | 105篇 |
1997年 | 77篇 |
1996年 | 53篇 |
1995年 | 49篇 |
1994年 | 38篇 |
1993年 | 35篇 |
1992年 | 23篇 |
1991年 | 15篇 |
1990年 | 15篇 |
1989年 | 16篇 |
1988年 | 9篇 |
1987年 | 6篇 |
1986年 | 7篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 4篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1976年 | 8篇 |
1974年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
22.
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) 相似文献
23.
Laura M. Haas Michael J. Carey Miron Livny Amit Shukla 《The VLDB Journal The International Journal on Very Large Data Bases》1997,6(3):241-256
In this paper, we re-examine the results of prior work on methods for computing ad hoc joins. We develop a detailed cost model for predicting join algorithm performance, and we use the model to develop cost formulas
for the major ad hoc join methods found in the relational database literature. We show that various pieces of “common wisdom” about join algorithm
performance fail to hold up when analyzed carefully, and we use our detailed cost model to derive op
timal buffer allocation schemes for each of the join methods examined here. We show that optimizing their buffer allocations
can lead to large performance improvements, e.g., as much as a 400% improvement in some cases. We also validate our cost model's
predictions by measuring an actual implementation of each join algorithm considered. The results of this work should be directly
useful to implementors of relational query optimizers and query processing systems.
Edited by M. Adiba. Received May 1993 / Accepted April 1996 相似文献
24.
介绍世界电子政务的发展状况,在总结各国电子政务发展经验和特点的基础上,指出我国要建设优质、高效的电子政务的关键,是要树立转变观念、统一规划、分步实施的建设理念. 相似文献
25.
26.
Jong Min Kim Donghee Lee Sang Lyul Min Chong Sang Kim 《Information Processing Letters》2003,85(2):93-97
A new dynamic buffer allocation strategy based on the notion of marginal gains is presented for the buffer cache that is used by the operating system to store frequently accessed disk blocks in main memory, and the performance of the proposed strategy is compared with those of previous allocation strategies. In the proposed strategy, marginal gain values are predicted by exploiting functions that approximate the expected number of buffer hits per unit time. Experimental results from both trace-driven simulation and an actual implementation in the FreeBSD operating system show that the proposed strategy accurately predicts the marginal gain values for various workloads resulting in significantly improved buffer hit ratios. 相似文献
27.
Binoy Ravindran Peng Li Tamir Hegazy 《Journal of Parallel and Distributed Computing》2003,63(12):1219-1242
We present two proactive resource allocation algorithms, RBA*-FT and OBA-FT, for fault-tolerant asynchronous real-time distributed systems. The algorithms consider an application model where task timeliness is specified by Jensen's benefit functions and the anticipated application workload during future time intervals is described by adaptation functions. In addition, we assume that reliability functions of processors are available a priori. Given these models, our objective is to maximize aggregate task benefit and minimize aggregate missed deadline ratio in the presence of processor failures. Since determining the optimal solution is computationally intractable, the algorithms heuristically compute sub-optimal resource allocations, but in polynomial time. Experimental results reveal that RBA*-FT and OBA-FT outperform their non-fault-tolerant counterparts in the presence of processor failures. Furthermore, RBA*-FT performs better than OBA-FT, although OBA-FT incurs better worst-case and amortized computational costs. Finally, we observe that both algorithms robustly withstand errors in the estimation of anticipated failures. 相似文献
28.
On irrigation schemes with rotational irrigation systems in semiarid tropics, the existing rules for water allocation are based on applying a fixed depth of water with every irrigation irrespective of the crops, their growth stages, and soils on which these crops are grown. However, when water resources are scarce, it is necessary to allocate water optimally to different crops grown in the irrigation scheme taking account of different soils in the command area. Allocating water optimally may lead to applying less water to crops than is needed to obtain the maximum yield. In this paper, a three stage approach is proposed for allocating water from a reservoir optimally based on a deficit irrigation approach, using a simulation-optimization model. The allocation results with a deficit irrigation approach are compared for a single crop (wheat) in an irrigation scheme in India, first with full irrigation (irrigation to fill the root zone to field capacity) and second with the existing rule. The full irrigation with a small irrigation interval was equivalent to adequate irrigation (no stress to the crop). It is found that practicing deficit irrigation enables the irrigated area and the total crop production in the irrigation scheme used for the case study to be increased by about 30–45% and 20–40%, respectively, over the existing rule and by 50 and 45%, respectively, over the adequate irrigation. Allocation of resources also varied with soil types. 相似文献
29.
30.
Cost estimates to guide pre-selection of processes 总被引:2,自引:0,他引:2
A process is a method of shaping, joining or surface-treating a material. Process selection has three steps. The first is to identify from the ‘menu’ of all available processes, the subset, which can give a chosen material the desired shape with the desired detail, precision and finish. The second is to choose, from among these, the ones that will do so at the lowest cost. The final step is to investigate the most promising processes in depth, exploring considerations such as availability, in-house experience, safety and environmental issues. The first two steps can be thought of as process pre-selection. Components have to be assembled and finished to create products. Here too, the ability to rank by cost, however crudely, helps guide pre-selection. Cost models are reviewed from the perspective of material and process selection. An approximate model is useful provided it has generality—that is, it must allow comparison of very different processes. Many approaches fail in this. One that works, based on resource consumption, is developed here and its use for selection is illustrated. It has been implemented as part of a tool that allows rapid pre-selection from a database of 112 processes. 相似文献