全文获取类型
收费全文 | 60341篇 |
免费 | 7105篇 |
国内免费 | 5942篇 |
专业分类
电工技术 | 7110篇 |
技术理论 | 1篇 |
综合类 | 9699篇 |
化学工业 | 2324篇 |
金属工艺 | 1421篇 |
机械仪表 | 4866篇 |
建筑科学 | 2425篇 |
矿业工程 | 1573篇 |
能源动力 | 1383篇 |
轻工业 | 1483篇 |
水利工程 | 1619篇 |
石油天然气 | 1182篇 |
武器工业 | 901篇 |
无线电 | 5665篇 |
一般工业技术 | 4522篇 |
冶金工业 | 1019篇 |
原子能技术 | 303篇 |
自动化技术 | 25892篇 |
出版年
2024年 | 245篇 |
2023年 | 646篇 |
2022年 | 1101篇 |
2021年 | 1246篇 |
2020年 | 1634篇 |
2019年 | 1625篇 |
2018年 | 1494篇 |
2017年 | 1954篇 |
2016年 | 2197篇 |
2015年 | 2369篇 |
2014年 | 3491篇 |
2013年 | 4320篇 |
2012年 | 4256篇 |
2011年 | 4702篇 |
2010年 | 3604篇 |
2009年 | 3910篇 |
2008年 | 4018篇 |
2007年 | 4614篇 |
2006年 | 4016篇 |
2005年 | 3480篇 |
2004年 | 2828篇 |
2003年 | 2481篇 |
2002年 | 2119篇 |
2001年 | 1798篇 |
2000年 | 1610篇 |
1999年 | 1330篇 |
1998年 | 1033篇 |
1997年 | 922篇 |
1996年 | 748篇 |
1995年 | 630篇 |
1994年 | 562篇 |
1993年 | 418篇 |
1992年 | 363篇 |
1991年 | 309篇 |
1990年 | 229篇 |
1989年 | 214篇 |
1988年 | 165篇 |
1987年 | 105篇 |
1986年 | 70篇 |
1985年 | 59篇 |
1984年 | 83篇 |
1983年 | 75篇 |
1982年 | 63篇 |
1981年 | 48篇 |
1980年 | 40篇 |
1979年 | 39篇 |
1978年 | 20篇 |
1977年 | 35篇 |
1976年 | 20篇 |
1975年 | 16篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
91.
In this paper a methodology for the use of temporal logic as an executable imperative language is introduced. The approach, which provides a concrete framework, calledMetateM, for executing temporal formulae, is motivated and illustrated through examples. In addition, this introduction provides references to further, more detailed, work relating to theMetateM approach to executable logics. 相似文献
92.
V. V. Semenov 《Cybernetics and Systems Analysis》2007,43(2):246-252
For infinitely dimensional convex vector maximization problems, it is proved that there exists, under certain conditions,
an arbitrarily small additive perturbation of the performance criterion by a linear continuous operator such that the perturbed
problem has efficient solutions.
The study was sponsored by the Ukrainian State Fund for Basic Research
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 105–114, March–April 2007. 相似文献
93.
A comparative analysis of such methods of defuzzification of fuzzy numbers as WABL (Weighted Averaging Based on Levels), centroid, and mean of maxima (MOM) is presented in the study. Analytic formulas are presented for calculating the defuzzification values for parametrically represented fuzzy numbers of triangular and trapezoidal form. 相似文献
94.
Chen-Tsung Kuo Author Vitae 《Pattern recognition》2007,40(2):742-755
Three dimensional models play an important role in many applications; the problem is how to select the appropriate models from a 3D database rapidly and accurately. In recent years, a variety of shape representations, statistical methods, and geometric algorithms have been proposed for matching 3D shapes or models. In this paper, we propose a 3D shape representation scheme based on a combination of principal plane analysis and dynamic programming. The proposed 3D shape representation scheme consists of three steps. First, a 3D model is transformed into a 2D image by projecting the vertices of the model onto its principal plane. Second, the convex hall of the 2D shape of the model is further segmented into multiple disjoint triangles using dynamic programming. Finally, for each triangle, a projection score histogram and moments are extracted as the feature vectors for similarity searching. Experimental results showed the robustness of the proposed scheme, which resists translation, rotation, scaling, noise, and destructive attacks. The proposed 3D model retrieval method performs fairly well in retrieving models having similar characteristics from a database of 3D models. 相似文献
95.
Branching and pruning: An optimal temporal POCL planner based on constraint programming 总被引:2,自引:0,他引:2
A key feature of modern optimal planners such as graphplan and blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planners provide an alternative branching scheme but lacking comparable pruning mechanisms do not perform as well. In this paper, a domain-independent formulation of temporal planning based on Constraint Programming is introduced that successfully combines a POCL branching scheme with powerful and sound pruning rules. The key novelty in the formulation is the ability to reason about supports, precedences, and causal links involving actions that are not in the plan. Experiments over a wide range of benchmarks show that the resulting optimal temporal planner is much faster than current ones and is competitive with the best parallel planners in the special case in which actions have all the same duration.1 相似文献
96.
立足于实际的数字系统级诊断 总被引:3,自引:1,他引:2
本文主要提出了一个立足于当前实际的系统级诊断模型。在这模型下,系统级诊断变得很容易。模型基于下列假定:将系统划分成既具有自测试又具有测试其它单位能力的一种单位;其测试能力和测试结果用模糊数学来描述;自测试时在各种情况下均能给出正确的结果;测试其它单位时,除测试者本身具有严重故障外,也均能给出正确结果。 相似文献
97.
I.C. Demetriou 《Computer Physics Communications》1997,100(3):297-310
A Fortan subroutine calculates the least squares approximation to n data values containing random errors subject to non-negative second divided differences (convexity). The method employs a dual active set quadratic programming technique that allows several concavities of an iterate to be corrected simultaneously, which is a distinctive feature of this calculation. A B-spline representation of the iterates reduces each active set calculation to an unconstrained minimization with fewer variables that requires only O(n) computer operations. Details in these techniques including the data structure that establishes the implementation of the method are specified. Numerical testing on a variety of data sets indicates that the subroutine is particularly efficient, terminating after a small number of active set changes, the subroutine being suitable for large numbers of data. A numerical example and its output is provided to help the use of the software. 相似文献
98.
Jonas Sjberg Qinghua Zhang Lennart Ljung Albert Benveniste Bernard Delyon Pierre-Yves Glorennec Hkan Hjalmarsson Anatoli Juditsky 《Automatica》1995,31(12):1691-1724
A nonlinear black-box structure for a dynamical system is a model structure that is prepared to describe virtually any nonlinear dynamics. There has been considerable recent interest in this area, with structures based on neural networks, radial basis networks, wavelet networks and hinging hyperplanes, as well as wavelet-transform-based methods and models based on fuzzy sets and fuzzy rules. This paper describes all these approaches in a common framework, from a user's perspective. It focuses on what are the common features in the different approaches, the choices that have to be made and what considerations are relevant for a successful system-identification application of these techniques. It is pointed out that the nonlinear structures can be seen as a concatenation of a mapping form observed data to a regression vector and a nonlinear mapping from the regressor space to the output space. These mappings are discussed separately. The latter mapping is usually formed as a basis function expansion. The basis functions are typically formed from one simple scalar function, which is modified in terms of scale and location. The expansion from the scalar argument to the regressor space is achieved by a radial- or a ridge-type approach. Basic techniques for estimating the parameters in the structures are criterion minimization, as well as two-step procedures, where first the relevant basis functions are determined, using data, and then a linear least-squares step to determine the coordinates of the function approximation. A particular problem is to deal with the large number of potentially necessary parameters. This is handled by making the number of ‘used’ parameters considerably less than the number of ‘offered’ parameters, by regularization, shrinking, pruning or regressor selection. 相似文献
99.
广义汉明重量下限函数Lr(j,d)的新证明 总被引:3,自引:0,他引:3
通过几个引理,对广义汉明重量下限函数Lr(j,d)的有限和表达式给出了一个思路简单的证明方法。给出了取整数函数[x],[x]的一些运算性质。 相似文献
100.