全文获取类型
收费全文 | 1139篇 |
免费 | 120篇 |
国内免费 | 105篇 |
专业分类
电工技术 | 31篇 |
综合类 | 69篇 |
化学工业 | 41篇 |
金属工艺 | 14篇 |
机械仪表 | 79篇 |
建筑科学 | 27篇 |
矿业工程 | 14篇 |
能源动力 | 35篇 |
轻工业 | 32篇 |
水利工程 | 22篇 |
石油天然气 | 21篇 |
武器工业 | 11篇 |
无线电 | 112篇 |
一般工业技术 | 36篇 |
冶金工业 | 8篇 |
原子能技术 | 5篇 |
自动化技术 | 807篇 |
出版年
2024年 | 2篇 |
2023年 | 12篇 |
2022年 | 9篇 |
2021年 | 11篇 |
2020年 | 19篇 |
2019年 | 22篇 |
2018年 | 23篇 |
2017年 | 32篇 |
2016年 | 27篇 |
2015年 | 39篇 |
2014年 | 52篇 |
2013年 | 59篇 |
2012年 | 84篇 |
2011年 | 102篇 |
2010年 | 77篇 |
2009年 | 70篇 |
2008年 | 82篇 |
2007年 | 118篇 |
2006年 | 101篇 |
2005年 | 79篇 |
2004年 | 61篇 |
2003年 | 61篇 |
2002年 | 45篇 |
2001年 | 25篇 |
2000年 | 26篇 |
1999年 | 15篇 |
1998年 | 19篇 |
1997年 | 20篇 |
1996年 | 5篇 |
1995年 | 10篇 |
1994年 | 12篇 |
1993年 | 7篇 |
1992年 | 8篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1958年 | 1篇 |
排序方式: 共有1364条查询结果,搜索用时 0 毫秒
1.
J.S. Sánchez 《Pattern recognition》2004,37(7):1561-1564
Instance-based learning methods like the nearest neighbour classifier generally suffer from the indiscriminate storage of all training instances, resulting in large memory requirements and slow execution speed. In this paper, new training set size reduction methods based on prototype generation and space partitioning are proposed. Experimental results show that the new algorithms achieve a very high reduction rate with still an important classification accuracy. 相似文献
2.
分散剂FDN对G级油井水泥作用机理探讨 总被引:6,自引:0,他引:6
采用液相电导法和酸度法研究了分散剂FDN对G级油井水泥水化速度的影响。发现FDN促进水泥的早期水化,但吸附-络合作用及磺酸根离子对Ca(OH)_2核晶过程的“毒化”作用使后期水化速度减慢。本研究证实ζ电位升高是FDN广生分散作用的主要因素。当FDN的吸附达饱和时,ζ电位达最大值,水泥浆的分散程度最大。 相似文献
3.
本文介绍了一种用于成品钢管生产线上的悬臂式钢管喷印装置,它是一台结构和功能都较复杂的大型机电一体化设备。文中简介了它的性能、特点和工作原理,对其各部分机械装置的构成及动作以及喷印控制系统的组成和功能进行了较为深入的描述。 相似文献
4.
结合西气东输管道工程燃气轮机驱动压缩机组设备订货及验收中对性能试验项目的确定、工厂试验及见证过程,介绍了燃压机组性能试验项目所涉及的主要内容、执行标准、需要达到的技术指标,各种性能试验的基本情况,买方参加工厂试验见证中需要重点处理好的问题等。以期为我国其他大型长输天然气管道机组订货及试验见证工作提供借鉴。 相似文献
5.
6.
A New Approach to Abstract Syntax with Variable Binding 总被引:1,自引:1,他引:0
The permutation model of set theory with atoms (FM-sets), devised by Fraenkel and Mostowski in the 1930s, supports notions
of ‘name-abstraction’ and ‘fresh name’ that provide a new way to represent, compute with, and reason about the syntax of formal
systems involving variable-binding operations. Inductively defined FM-sets involving the name-abstraction set former (together
with Cartesian product and disjoint union) can correctly encode syntax modulo renaming of bound variables. In this way, the
standard theory of algebraic data types can be extended to encompass signatures involving binding operators. In particular,
there is an associated notion of structural recursion for defining syntax-manipulating functions (such as capture avoiding
substitution, set of free variables, etc.) and a notion of proof by structural induction, both of which remain pleasingly
close to informal practice in computer science.
Received October 2000 / Accepted in revised form April 2001 相似文献
7.
Sidney C. Bailin 《Journal of Automated Reasoning》1988,4(3):269-286
We present a semi-decision algorithm for the unifiability of two set-theoretic formulas modulo -reduction. The algorithm is based on the approach developed by G. Huet for type theory, but requires additional measures because formulas in set theory are not all normalizable. We present the algorithm in an Ada-like pseudocode, and then prove two theorems that show the completeness and correctness of the procedure. We conclude by showing that -unification is not a complete quantifier substitution method for set theory-unlile first-order unification and first-order logic. In this respect set theory is similar to type theory (higher-order logic).This material is based upon work supported by the National Science Foundation under award number ISI-8560438. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation. 相似文献
8.
9.
《Automatica》2014,50(12):3019-3029
An adaptive control algorithm for open-loop stable, constrained, linear, multiple input multiple output systems is presented. The proposed approach can deal with both input and output constraints, as well as measurement noise and output disturbances. The adaptive controller consists of an iterative set membership identification algorithm, that provides a set of candidate plant models at each time step, and a model predictive controller, that enforces input and output constraints for all the plants inside the model set. The algorithm relies only on the solution of standard convex optimization problems that are guaranteed to be recursively feasible. The experimental results obtained by applying the proposed controller to a quad-tank testbed are presented. 相似文献
10.
We study online adaptive scheduling for multiple sets of parallel jobs, where each set may contain one or more jobs with time-varying parallelism. This two-level scheduling scenario arises naturally when multiple parallel applications are submitted by different users or user groups in large parallel systems, where both user-level fairness and system-wide efficiency are of important concerns. To achieve fairness, we use the well-known equi-partitioning algorithm to distribute the available processors among the active job sets at any time. For efficiency, we apply a feedback-driven adaptive scheduler that periodically adjusts the processor allocations within each set by consciously exploiting the jobs’ execution history. We show that our algorithm achieves asymptotically competitive performance with respect to the set response time, which incorporates two widely used performance metrics, namely, total response time and makespan, as special cases. Both theoretical analysis and simulation results demonstrate that our algorithm improves upon an existing scheduler that provides only fairness but lacks efficiency. Furthermore, we provide a generalized framework for analyzing a family of scheduling algorithms based on feedback-driven policies with provable efficiency. Finally, we consider an extended multi-level hierarchical scheduling model and present a fair and efficient solution that effectively reduces the problem to the two-level model. 相似文献