全文获取类型
收费全文 | 3146篇 |
免费 | 261篇 |
国内免费 | 236篇 |
专业分类
电工技术 | 172篇 |
综合类 | 890篇 |
化学工业 | 80篇 |
金属工艺 | 13篇 |
机械仪表 | 99篇 |
建筑科学 | 92篇 |
矿业工程 | 20篇 |
能源动力 | 48篇 |
轻工业 | 67篇 |
水利工程 | 34篇 |
石油天然气 | 20篇 |
武器工业 | 20篇 |
无线电 | 352篇 |
一般工业技术 | 290篇 |
冶金工业 | 17篇 |
原子能技术 | 12篇 |
自动化技术 | 1417篇 |
出版年
2024年 | 11篇 |
2023年 | 29篇 |
2022年 | 39篇 |
2021年 | 36篇 |
2020年 | 40篇 |
2019年 | 64篇 |
2018年 | 55篇 |
2017年 | 63篇 |
2016年 | 92篇 |
2015年 | 78篇 |
2014年 | 129篇 |
2013年 | 174篇 |
2012年 | 176篇 |
2011年 | 221篇 |
2010年 | 155篇 |
2009年 | 197篇 |
2008年 | 173篇 |
2007年 | 202篇 |
2006年 | 170篇 |
2005年 | 163篇 |
2004年 | 114篇 |
2003年 | 130篇 |
2002年 | 112篇 |
2001年 | 96篇 |
2000年 | 129篇 |
1999年 | 95篇 |
1998年 | 84篇 |
1997年 | 81篇 |
1996年 | 49篇 |
1995年 | 75篇 |
1994年 | 88篇 |
1993年 | 46篇 |
1992年 | 49篇 |
1991年 | 47篇 |
1990年 | 37篇 |
1989年 | 42篇 |
1988年 | 28篇 |
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篇 |
排序方式: 共有3643条查询结果,搜索用时 0 毫秒
81.
82.
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). 相似文献
83.
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. 相似文献
84.
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. 相似文献
85.
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. 相似文献
86.
87.
Bashir Ahmad 《Computers & Mathematics with Applications》2011,62(3):1150-1156
We study a class of anti-periodic boundary value problems of fractional differential equations. Some existence and uniqueness results are obtained by applying some standard fixed point principles. Several examples are given to illustrate the results. 相似文献
88.
We proved some almost sure limit theorems for standard strongly dependent Gaussian sequences in nonstationary cases under some mild conditions. 相似文献
89.
In this paper, we consider the following nonlinear fractional three-point boundary value problem
90.
The conventional game theory is concerned with how rational individuals make decisions when they are faced with known payoffs. In the real world, sometimes the payoffs are not known and have to be estimated, and sometimes the payoffs are only approximately known. This paper develops a solution method for the two-person zero-sum game where the payoffs are imprecise and are represented by interval data. Since the payoffs are imprecise, the value of the game should be imprecise as well. A pair of two-level mathematical programs is formulated to obtain the upper bound and lower bound of the value of the game. Based on the duality theorem and by applying a variable substitution technique, the pair of two-level mathematical programs is transformed to a pair of ordinary one-level linear programs. Solving the pair of linear programs produces the interval of the value of the game. It is shown that the two players in the game have the same upper bound and lower bound for the value of the imprecise game. An example illustrates the whole idea and sheds some light on imprecise game. 相似文献