全文获取类型
收费全文 | 794篇 |
免费 | 54篇 |
国内免费 | 56篇 |
学科分类
工业技术 | 904篇 |
出版年
2024年 | 3篇 |
2023年 | 4篇 |
2022年 | 3篇 |
2021年 | 5篇 |
2020年 | 13篇 |
2019年 | 18篇 |
2018年 | 23篇 |
2017年 | 17篇 |
2016年 | 24篇 |
2015年 | 24篇 |
2014年 | 31篇 |
2013年 | 52篇 |
2012年 | 74篇 |
2011年 | 69篇 |
2010年 | 29篇 |
2009年 | 41篇 |
2008年 | 43篇 |
2007年 | 37篇 |
2006年 | 38篇 |
2005年 | 33篇 |
2004年 | 33篇 |
2003年 | 27篇 |
2002年 | 25篇 |
2001年 | 21篇 |
2000年 | 18篇 |
1999年 | 16篇 |
1998年 | 21篇 |
1997年 | 21篇 |
1996年 | 13篇 |
1995年 | 14篇 |
1994年 | 18篇 |
1993年 | 16篇 |
1992年 | 19篇 |
1991年 | 9篇 |
1990年 | 8篇 |
1989年 | 10篇 |
1988年 | 2篇 |
1987年 | 7篇 |
1986年 | 5篇 |
1985年 | 1篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有904条查询结果,搜索用时 15 毫秒
1.
We establish a numerically feasible algorithm to find a simplicial approximation A to a certain part
of the boundary of the set
of stable (or Hurwitz) polynomials of degree 4. Moreover, we have that
. Using this, we build an algorithm to find a piecewise-linear approximation to the intersection curve of a given surface contained in
4 with
. We have also devised an efficient computer program to perform all these operations. The main motivation is to find the curve of nondegenerate bifurcation points in parameter space for a given 2-parametric Hopf bifurcation problem of dimension 4. 相似文献
2.
In this note the stability of a second-order quasi-polynomial with a single delay is studied. Although there is a vast literature on this problem, most available solutions are limited to some particular cases. Moreover, some published results on this subject appear to contain imprecise, or even wrong, conditions. The purpose of this note is to show that by accurate application of known theories, a complete explicit characterization of stability regions can be derived in a most general case. As a byproduct of the proposed analysis, we show that in the high-order case the quasi-polynomial is delay-independent unstable whenever its delay-free version has an odd number of unstable roots (or, equivalently, a negative static gain). 相似文献
3.
4.
5.
ON GENERALIZED FRACTIONAL PROCESSES 总被引:3,自引:0,他引:3
Abstract. A class of stationary long-memory processes is proposed which is an extension of the fractional autoregressive moving-average (FARMA) model. The FARMA model is limited by the fact that it does not allow data with persistent cyclic (or seasonal) behavior to be considered. Our extension, which includes the FARMA model as a special case, makes use of the properties of the generating function of the Gegenbauer polynomials, and we refer to these models as Gegenbauer autoregressive moving-average (GARMA) models. While the FARMA model has a peak in the spectrum at f = 0, the GARMA process can model long-term periodic behavior for any frequency 0 f 0.5. Properties of the GARMA process are examined and techniques for generation of realizations, model identification and parameter estimation are proposed. The use of the GARMA model is illustrated through simulated examples as well as with classical sunspot data. 相似文献
6.
Farid Ablayev Alexander Vasiliev 《International Journal of Software and Informatics》2013,7(4):485-500
In the paper, we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs). Our method is based on ˉngerprinting technique and representation of Boolean functions by their characteristic polynomials. We use circuit notation for branching programs for desired algorithms presentation. For several known functions our approach provides optimal QOBDDs. Namely we consider such functions as MODm, EQn, Palindromen, and PERMn (testing whether given Boolean matrix is the Permutation Matrix). We also propose a generalization of our method and apply it to the Boolean variant of the Hidden
Subgroup Problem. 相似文献
7.
8.
Linear Feedback Shift Registers (LFSRs) constitute a very efficient mechanism for generating pseudoexhaustive or pseudo-random test sets for the built-in self-testing of digital circuits. However, a well-known problem with the use of LFSRs is the occurrence of linear dependencies in the generated patterns. In this paper, we show for the first time that the amount of linear dependencies can be controlled by selecting appropriate characteristic polynomials and reordering the LFSR cells. We identify two classes of such polynomials which, by appropriate LFSR cell ordering, guarantee that a large ratio of linear dependencies cannot occur. Experimental results show significant enhancements on the fault coverage for pseudo-random testing and support the theoretical relation between minimization of linear dependencies and effective fault coverage.This work was partially supported by NSF grant MIP-9409905, a 1993–94 ACM/IEEE Design Automation Scholarship and a grant from Nissan Corporation. A preliminary version of this work appeared in A Class of Good Characteristic Polynomials for LFSR Test Pattern Generators, in Proc. of IEEE International Conference on Computer Design, Oct. 1994, pp. 292–295, where it received the ICCD'94 Best Paper Award. 相似文献
9.
The transformationf(x)f(x
3–3x) is studied. We show that for allF
q
of characteristic >3 andn1, there existsf(x)F
q
[x] of degreen which generates an infinite sequence of irreducible polynomials of degree 3
i
n by the iteration of this transformation. 相似文献
10.
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of Rk, assuming that P is positive on the simplex. This bound depends only on the number of variables k, the degree d and the bitsize τ of the coefficients of P and improves all the previous bounds for arbitrary polynomials which are positive over the simplex. 相似文献