全文获取类型
收费全文 | 3157篇 |
免费 | 266篇 |
国内免费 | 237篇 |
专业分类
电工技术 | 173篇 |
综合类 | 892篇 |
化学工业 | 80篇 |
金属工艺 | 13篇 |
机械仪表 | 101篇 |
建筑科学 | 96篇 |
矿业工程 | 21篇 |
能源动力 | 49篇 |
轻工业 | 70篇 |
水利工程 | 35篇 |
石油天然气 | 19篇 |
武器工业 | 20篇 |
无线电 | 341篇 |
一般工业技术 | 283篇 |
冶金工业 | 15篇 |
原子能技术 | 13篇 |
自动化技术 | 1439篇 |
出版年
2024年 | 8篇 |
2023年 | 27篇 |
2022年 | 37篇 |
2021年 | 37篇 |
2020年 | 41篇 |
2019年 | 63篇 |
2018年 | 53篇 |
2017年 | 62篇 |
2016年 | 90篇 |
2015年 | 75篇 |
2014年 | 127篇 |
2013年 | 177篇 |
2012年 | 175篇 |
2011年 | 222篇 |
2010年 | 164篇 |
2009年 | 197篇 |
2008年 | 176篇 |
2007年 | 204篇 |
2006年 | 171篇 |
2005年 | 162篇 |
2004年 | 115篇 |
2003年 | 131篇 |
2002年 | 113篇 |
2001年 | 98篇 |
2000年 | 132篇 |
1999年 | 96篇 |
1998年 | 85篇 |
1997年 | 83篇 |
1996年 | 49篇 |
1995年 | 77篇 |
1994年 | 90篇 |
1993年 | 46篇 |
1992年 | 49篇 |
1991年 | 46篇 |
1990年 | 37篇 |
1989年 | 42篇 |
1988年 | 29篇 |
1987年 | 23篇 |
1986年 | 7篇 |
1985年 | 14篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1975年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有3660条查询结果,搜索用时 312 毫秒
101.
史开泉 《山东大学学报(工学版)》1998,(2)
提出双枝模糊集S的理论,是(I)研究的继续.提出双枝模糊集S的并-普通分解定理,交-普通分解定理.这些结论建立了双枝模糊集S与普通集Sλ之间的关系,这些结论为建立双枝模糊推理,双枝模糊控制作了理论准备.结论指出:(1)双枝模糊集S同时存在并-普通分解形式:S=∪λ∈[-1,1]λSλ和交-普通分解形式:S=∩λ∈[-1,1]λSλ;这两种分解形式是建立双枝模糊推理理论,双枝模糊控制理论的理论基础.(2)单枝模糊集A(L.A.ZadehFuzzySetA)的并-普通分解定理,交-普通分解定理是双枝模糊集S的并-普通分解定理,交-普通分解定理的特例. 相似文献
102.
Jean Marcel Pallo 《Information Processing Letters》2010,111(1):46-50
We generalize the Kleene theorem to the case where nonassociative products are used. For this purpose, we apply rotations restricted to the root of binary trees. 相似文献
103.
This paper focuses on the adaptive observer design for nonlinear discrete‐time MIMO systems with unknown time‐delay and nonlinear dynamics. The delayed states involved in the system are arguments of a nonlinear function and only the estimated delay is utilized. By constructing an appropriate Lyapunov–Krasovskii function, the delay estimation error is considered in the observer parameter design. The proposed method is then extended to the system with a nonlinear output measurement equation and the delayed dynamics. With the help of a high‐order neural network (HONN), the requirement for a precise system model, the linear‐in‐the‐parameters (LIP) assumption of the delayed states, the Lipschitz or norm‐boundedness assumption of unknown nonlinearities are removed. A novel converse Lyapunov technical lemma is also developed and used to prove the uniform ultimate boundedness of the proposed observer. The effectiveness of the proposed results is verified by simulations. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
104.
105.
Eugenio Roanes-Lozano Nicolas van Labeke Eugenio Roanes-Macías 《Mathematics and computers in simulation》2010
Many (2D) Dynamic Geometry Systems (DGSs) are able to export numeric coordinates and equations with numeric coefficients to Computer Algebra Systems (CASs). Moreover, different approaches and systems that link (2D) DGSs with CASs, so that symbolic coordinates and equations with symbolic coefficients can be exported from the DGS to the CAS, already exist. Although the 3D DGS Calques3D can export numeric coordinates and equations with numeric coefficients to Maple and Mathematica, it cannot export symbolic coordinates and equations with symbolic coefficients. A connection between the 3D DGS Calques3D and the CAS Maple, that can handle symbolic coordinates and equations with symbolic coefficients, is presented here. Its main interest is to provide a convenient time-saving way to explore problems and directly obtain both algebraic and numeric data when dealing with a 3D extension of “ruler and compass geometry”. This link has not only educational purposes but mathematical ones, like mechanical theorem proving in geometry, geometric discovery (hypotheses completion), geometric loci finding… As far as we know, there is no comparable “symbolic” link in the 3D case, except the prototype 3D-LD (restricted to determining algebraic surfaces as geometric loci). 相似文献
106.
Duc-Khanh Tran Christophe Ringeissen Silvio Ranise Hélène Kirchner 《Journal of Symbolic Computation》2010
Decision procedures are key components of theorem provers and constraint satisfaction systems. Their modular combination is of prime interest for building efficient systems, but their effective use is often limited by poor interface capabilities, when such procedures only provide a simple “sat/unsat” answer. In this paper, we develop a framework to design cooperation schemas between such procedures while maintaining modularity of their interfaces. First, we use the framework to specify and prove the correctness of classic combination schemas by Nelson–Oppen and Shostak. Second, we introduce the concept of deduction complete satisfiability procedures, we show how to build them for large classes of theories, then we provide a schema to modularly combine them. Third, we consider the problem of modularly constructing explanations for combinations by re-using available proof-producing procedures for the component theories. 相似文献
107.
This paper proposes a systematic technique to design multiple robust H∞ controllers. The proposed technique achieves a desired robust performance objective, which is impossible to achieve with a single robust controller, by dividing the uncertainty set into several subsets and by designing a robust controller to each subset. To achieve this goal with a small number of divisions of the uncertainty set, an optimization problem is formulated. Since the cost function of this optimization problem is not a smooth function, a numerical nonsmooth optimization algorithm is proposed to solve this problem. This method avoids the use of Lyapunov variables, and therefore it leads to a moderate size optimization problem. A numerical example shows that the proposed multiple robust control method can improve the closed‐loop performance when a single robust controller cannot achieve satisfactory performance. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
108.
Onur Toker 《国际强度与非线性控制杂志
》2010,20(6):623-638
》2010,20(6):623-638
In this paper, a Kharitonov‐like theorem is proved for testing robust stability independent of delay of interval quasipolynomials, p(s)+∑eqk(s), where p and qk's are interval polynomials with uncertain coefficients. It is shown that the robust stability test of the quasipolynomial basically reduces to the stability test of a set of Kharitonov‐like vertex quasipolynomials, where stability is interpreted as stability independent of delay. As discovered in (IEEE Trans. Autom. Control 2008; 53 :1219–1234), the well‐known vertex‐type robust stability result reported in (IMA J. Math. Contr. Info. 1988; 5 :117–123) (See also (IEEE Trans. Circ. Syst. 1990; 37 (7):969–972; Proc. 34th IEEE Conf. Decision Contr., New Orleans, LA, December 1995; 392–394) does contain a flaw. An alternative approach is proposed in (IEEE Trans. Autom. Control 2008; 53 :1219–1234), and both frequency sweeping and vertex type robust stability tests are developed for quasipolynomials with polytopic coefficient uncertainties. Under a specific assumption, it is shown in (IEEE Trans. Autom. Control 2008; 53 :1219–1234) that robust stability independent of delay of an interval quasipolynomial can be reduced to stability independent of delay of a set of Kharitonov‐like vertex quasipolynomials. In this paper, we show that the assumption made in (IEEE Trans. Autom. Control 2008; 53 :1219–1234) is redundant, and the Kharitonov‐like result reported in (IEEE Trans. Autom. Control 2008; 53 :1219–1234) is true without any additional assumption, and can be applied to all quasipolynomials. The key idea used in (IEEE Trans. Autom. Control 2008; 53 :1219–1234) was the equivalence of Hurwitz stability and ?‐o‐stability for interval polynomials with constant term never equal to zero. This simple observation implies that the well‐known Kharitonov theorem for Hurwitz stability can be applied for ?‐o‐stability, provided that the constant term of the interval polynomial never vanishes. However, this line of approach is based on a specific assumption, which we call the CNF‐assumption. In this paper, we follow a different approach: First, robust ?‐o‐stability problem is studied in a more general framework, including the cases where degree drop is allowed, and the constant term as well as other higher‐orders terms can vanish. Then, generalized Kharitonov‐like theorems are proved for ?‐o‐stability, and inspired by the techniques used in (IEEE Trans. Autom. Control 2008; 53 :1219–1234), it is shown that robust stability independent of delay of an interval quasipolynomial can be reduced to stability independent of delay of a set of Kharitonov‐like vertex quasipolynomials, even if the assumption adopted in (IEEE Trans. Autom. Control 2008; 53 :1219–1234) is not satisfied. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
109.
Two model reference adaptive system (MRAS) estimators are developed for identifying the parameters of permanent magnet synchronous motors (PMSM) based on the Lyapunov stability theorem and the Popov stability criterion, respectively. The proposed estimators only need online measurement of currents, voltages, and rotor speed to effectively estimate stator resistance, inductance, and rotor flux-linkage simultaneously. The performance of the estimators is compared and verified through simulations and experiments, which show that the two estimators are simple, have good robustness against parameter variation, and are accurate in parameter tracking. However, the estimator based on the Popov stability criterion, which can overcome parameter variation in a practical system, is superior in terms of response speed and convergence speed since there are both proportional and integral units in the estimator, in contrast to only one integral unit in the estimator based on the Lyapunov stability theorem. In addition, the estimator based on the Popov stability criterion does not need the expertise that is required in designing a Lyapunov function. 相似文献
110.
近年来,出具证明编译器作为构建高可信软件的重要途径,逐渐成为编译器理论和形式化验证的研究热点.在其理论框架中,编译器需要借助自动定理证明技术,自动地证明验证条件并生成机器可检查的证明项,因此好的自动定理证明器对出具证明编译器至关重要.本文基于Simplex算法在出具证明编译器的框架内设计并实现了一个支持线性整数命题求解的自动定理证明器,并且提出一套证明项构造方法,将其应用于自动定理证明器中可生成Coq可检查的证明. 相似文献