全文获取类型
收费全文 | 1491篇 |
免费 | 107篇 |
国内免费 | 68篇 |
专业分类
电工技术 | 75篇 |
综合类 | 97篇 |
化学工业 | 280篇 |
金属工艺 | 51篇 |
机械仪表 | 64篇 |
建筑科学 | 81篇 |
矿业工程 | 28篇 |
能源动力 | 49篇 |
轻工业 | 104篇 |
水利工程 | 41篇 |
石油天然气 | 28篇 |
武器工业 | 2篇 |
无线电 | 214篇 |
一般工业技术 | 166篇 |
冶金工业 | 39篇 |
原子能技术 | 34篇 |
自动化技术 | 313篇 |
出版年
2024年 | 2篇 |
2023年 | 8篇 |
2022年 | 23篇 |
2021年 | 48篇 |
2020年 | 19篇 |
2019年 | 13篇 |
2018年 | 26篇 |
2017年 | 23篇 |
2016年 | 17篇 |
2015年 | 50篇 |
2014年 | 41篇 |
2013年 | 51篇 |
2012年 | 69篇 |
2011年 | 171篇 |
2010年 | 71篇 |
2009年 | 112篇 |
2008年 | 126篇 |
2007年 | 127篇 |
2006年 | 107篇 |
2005年 | 76篇 |
2004年 | 57篇 |
2003年 | 88篇 |
2002年 | 65篇 |
2001年 | 50篇 |
2000年 | 35篇 |
1999年 | 29篇 |
1998年 | 23篇 |
1997年 | 26篇 |
1996年 | 25篇 |
1995年 | 19篇 |
1994年 | 8篇 |
1993年 | 8篇 |
1992年 | 6篇 |
1991年 | 12篇 |
1990年 | 8篇 |
1989年 | 10篇 |
1987年 | 2篇 |
1986年 | 5篇 |
1985年 | 4篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 3篇 |
排序方式: 共有1666条查询结果,搜索用时 218 毫秒
61.
Matthew R. Graham Author Vitae Author Vitae Raymond A. de Callafon Author Vitae 《Automatica》2009,45(6):1489-1496
This paper introduces an alternative formulation of the Kalman-Yakubovich-Popov (KYP) Lemma, relating an infinite dimensional Frequency Domain Inequality (FDI) to a pair of finite dimensional Linear Matrix Inequalities (LMI). It is shown that this new formulation encompasses previous generalizations of the KYP Lemma which hold in the case the coefficient matrix of the FDI does not depend on frequency. In addition, it allows the coefficient matrix of the frequency domain inequality to vary affinely with the frequency parameter. One application of this results is illustrated in an example of computing upper bounds to the structured singular value with frequency-dependent scalings. 相似文献
62.
The interaction interface between two molecules can be represented as a bisector surface equidistant from the two sets of spheres of varying radii representing atoms. We recursively divide a box containing both sphere-sets into uniform pairs of sub-boxes. The distance from each new box to each sphere-set is conservatively approximated by an interval, and the number of sphere-box computations is greatly reduced by pre-partitioning each sphere-set using a kd-tree. The subdivision terminates at a specified resolution, creating a box partition (BP) tree. A piecewise linear approximation of the bisector surface is then obtained by traversing the leaves of the BP tree and connecting points equidistant from the sphere-sets. In 124 experiments with up to 16,728 spheres, a bisector surface with a resolution of 1/24 of the original bounding box was obtained in 28.8 ms on average. 相似文献
63.
B. Farhadinia 《Information Sciences》2011,181(7):1348-1357
The main aims of this study are to derive the fuzzy Euler-Lagrange conditions for both fuzzy unconstrained and constrained variational problems based on the concepts of differentiability and integrability of a fuzzy mapping that may be parameterized by the left and right-hand functions of its α-level sets. 相似文献
64.
We consider the stochastic input-output properties of a simple non-linear dynamical system, the so-called Page-Hinkley detector, playing a key role in change detection, and also in queuing theory. We show that for L-mixing inputs with negative expectation the output process of this system is L-mixing. The result is applied to get an upper bound for the false alarm rate. The proof is then adapted to get a similar result for the case of random i.i.d. inputs. Possible extensions and open problems are given in the discussion. 相似文献
65.
Optimal design for generalized linear models has primarily focused on univariate data. Often experiments are performed that have multiple dependent responses described by regression type models, and it is of interest and of value to design the experiment for all these responses. This requires a multivariate distribution underlying a pre-chosen model for the data. Here, we consider the design of experiments for bivariate binary data which are dependent. We explore Copula functions which provide a rich and flexible class of structures to derive joint distributions for bivariate binary data. We present methods for deriving optimal experimental designs for dependent bivariate binary data using Copulas, and demonstrate that, by including the dependence between responses in the design process, more efficient parameter estimates are obtained than by the usual practice of simply designing for a single variable only. Further, we investigate the robustness of designs with respect to initial parameter estimates and Copula function, and also show the performance of compound criteria within this bivariate binary setting. 相似文献
66.
Jianer Chen Qilong FengYang Liu Songjian LuJianxin Wang 《Theoretical computer science》2011,412(23):2503-2512
Based on the method of (n,k)-universal sets, we present a deterministic parameterized algorithm for the weighted rd-matching problem with time complexity O∗(4(r−1)k+o(k)), improving the previous best upper bound O∗(4rk+o(k)). In particular, the algorithm applied to the unweighted 3d-matching problem results in a deterministic algorithm with time O∗(16k+o(k)), improving the previous best result O∗(21.26k). For the weighted r-set packing problem, we present a deterministic parameterized algorithm with time complexity O∗(2(2r−1)k+o(k)), improving the previous best result O∗(22rk+o(k)). The algorithm, when applied to the unweighted 3-set packing problem, has running time O∗(32k+o(k)), improving the previous best result O∗(43.62k+o(k)). Moreover, for the weighted r-set packing and weighted rd-matching problems, we give a kernel of size O(kr), which is the first kernelization algorithm for the problems on weighted versions. 相似文献
67.
Jens MaßbergJan Schneider 《Theoretical computer science》2011,412(50):6948-6958
We formulate a generalization of the NP-complete rectangle packing problem by parameterizing it in terms of packing density, the ratio of rectangle areas, and the aspect ratio of individual rectangles. Then we show that almost all restrictions of this problem remain NP-complete and identify some cases where the answer to the decision problem can be found in constant time. 相似文献
68.
We show that for some special functions (called k-multigrid equidistributed functions), we can compute the limit of the frequency of patterns in the discretization of their graph, when the resolution tends to zero. This result is applied to parabolas. We deduce also that local length estimators almost never converge to the length for the parabolas. 相似文献
69.
70.
Multiband frequency domain synthesis consists in the minimization of a finite family of closed-loop transfer functions on prescribed frequency intervals. This is an algorithmically difficult problem due to its inherent nonsmoothness and nonconvexity. We extend our previous work on nonsmooth H∞ synthesis to develop a nonsmooth optimization technique to compute local solutions to multiband synthesis problems. The proposed method is shown to perform well on illustrative examples. 相似文献