全文获取类型
收费全文 | 5486篇 |
免费 | 315篇 |
国内免费 | 198篇 |
专业分类
电工技术 | 192篇 |
综合类 | 296篇 |
化学工业 | 1041篇 |
金属工艺 | 297篇 |
机械仪表 | 226篇 |
建筑科学 | 213篇 |
矿业工程 | 36篇 |
能源动力 | 151篇 |
轻工业 | 306篇 |
水利工程 | 65篇 |
石油天然气 | 75篇 |
武器工业 | 21篇 |
无线电 | 534篇 |
一般工业技术 | 1038篇 |
冶金工业 | 116篇 |
原子能技术 | 92篇 |
自动化技术 | 1300篇 |
出版年
2024年 | 4篇 |
2023年 | 55篇 |
2022年 | 86篇 |
2021年 | 75篇 |
2020年 | 84篇 |
2019年 | 85篇 |
2018年 | 100篇 |
2017年 | 128篇 |
2016年 | 109篇 |
2015年 | 113篇 |
2014年 | 204篇 |
2013年 | 244篇 |
2012年 | 257篇 |
2011年 | 406篇 |
2010年 | 295篇 |
2009年 | 323篇 |
2008年 | 378篇 |
2007年 | 410篇 |
2006年 | 351篇 |
2005年 | 315篇 |
2004年 | 257篇 |
2003年 | 238篇 |
2002年 | 167篇 |
2001年 | 176篇 |
2000年 | 253篇 |
1999年 | 115篇 |
1998年 | 84篇 |
1997年 | 72篇 |
1996年 | 72篇 |
1995年 | 77篇 |
1994年 | 91篇 |
1993年 | 68篇 |
1992年 | 57篇 |
1991年 | 44篇 |
1990年 | 40篇 |
1989年 | 32篇 |
1988年 | 26篇 |
1987年 | 23篇 |
1986年 | 25篇 |
1985年 | 18篇 |
1984年 | 7篇 |
1983年 | 2篇 |
1982年 | 10篇 |
1981年 | 10篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 1篇 |
排序方式: 共有5999条查询结果,搜索用时 0 毫秒
71.
Khalida Inayat Noor Sarfraz Nawaz Malik 《Computers & Mathematics with Applications》2011,62(1):367-375
The aim of this paper is to generalize the conic domain defined by Kanas and Wisniowska, and define the class of functions which map the open unit disk E onto this generalized conic domain. A brief comparison between these conic domains is the main motivation of this paper. A correction is made in selecting the range interval of order of conic domain. 相似文献
72.
73.
Chvátal-Gomory cuts are among the most well-known classes of cutting planes for general integer linear programs (ILPs). In
case the constraint multipliers are either 0 or
, such cuts are known as
-cuts. It has been proven by Caprara and Fischetti (Math. Program. 74:221–235, 1996) that separation of
-cuts is
-hard.
In this paper, we study ways to separate
-cuts effectively in practice. We propose a range of preprocessing rules to reduce the size of the separation problem. The
core of the preprocessing builds a Gaussian elimination-like procedure. To separate the most violated
-cut, we formulate the (reduced) problem as integer linear program. Some simple heuristic separation routines complete the
algorithmic framework.
Computational experiments on benchmark instances show that the combination of preprocessing with exact and/or heuristic separation
is a very vital idea to generate strong generic cutting planes for integer linear programs and to reduce the overall computation
times of state-of-the-art ILP-solvers. 相似文献
74.
75.
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. 相似文献
76.
We revisit in this paper the concept of decoding binary cyclic codes with Gröbner bases. These ideas were first introduced by Cooper, then Chen, Reed, Helleseth and Truong, and eventually by Orsini and Sala. We discuss here another way of putting the decoding problem into equations: the Newton identities. Although these identities have been extensively used for decoding, the work was done manually, to provide formulas for the coefficients of the locator polynomial. This was achieved by Reed, Chen, Truong and others in a long series of papers, for decoding quadratic residue codes, on a case-by-case basis. It is tempting to automate these computations, using elimination theory and Gröbner bases.Thus, we study in this paper the properties of the system defined by the Newton identities, for decoding binary cyclic codes. This is done in two steps, first we prove some facts about the variety associated with this system, then we prove that the ideal itself contains relevant equations for decoding, which lead to formulas.Then we consider the so-called online Gröbner basis decoding, where the work of computing a Gröbner basis is done for each received word. It is much more efficient for practical purposes than preprocessing and substituting into the formulas. Finally, we conclude with some computational results, for codes of interesting length (about one hundred). 相似文献
77.
Convergence performance comparison of quantum-inspired multi-objective evolutionary algorithms 总被引:1,自引:0,他引:1
In recent research, we proposed a general framework of quantum-inspired multi-objective evolutionary algorithms (QMOEA) and gave one of its sufficient convergence conditions to the Pareto optimal set. In this paper, two Q-gate operators, H gate and R&N gate, are experimentally validated as two Q-gate paradigms meeting the convergence condition. The former is a modified rotation gate, and the latter is a combination of rotation gate and NOT gate with the specified probability. To investigate their effectiveness and applicability, several experiments on the multi-objective 0/1 knapsack problems are carried out. Compared to two typical evolutionary algorithms and the QMOEA only with rotation gate, the QMOEA with H gate and R&N gate have more powerful convergence ability in high complex instances. Moreover, the QMOEA with R&N gate has the best convergence in almost all of the experimental problems. Furthermore, the appropriate ε value regions for two Q-gates are verified. 相似文献
78.
79.
Xiaojun Ban 《International journal of systems science》2016,47(15):3646-3655
In this paper, the control problem for a class of linear parameter varying (LPV) plant subject to actuator saturation is investigated. For the saturated LPV plant depending on the scheduling parameters in linear fractional transformation (LFT) fashion, a gain-scheduled output feedback controller in the LFT form is designed to guarantee the stability of the closed-loop LPV system and provide optimised disturbance/error attenuation performance. By using the congruent transformation, the synthesis condition is formulated as a convex optimisation problem in terms of a finite number of LMIs for which efficient optimisation techniques are available. The nonlinear inverted pendulum problem is employed to demonstrate the effectiveness of the proposed approach. Moreover, the comparison between our LPV saturated approach with an existing linear saturated method reveals the advantage of the LPV controller when handling nonlinear plants. 相似文献
80.
Satish Shukla Dhananjay Gopal Antonio-Francisco Roldán-López-de-Hierro 《国际通用系统杂志》2016,45(7-8):815-829
Very recently, in order to unify the notions of fuzzy metric space and metric-like space, Shukla and Abbas introduced the concept of fuzzy metric-like space and proved some fixed-point results in this setting. In this article, we modify the notion of Cauchy sequence and completeness to generalize their results. Thus, we extend their theorems to a more general framework, which is also appropriate to generalize some recent, well-known results in this line of research. Furthermore, several examples are presented to illustrate the significance of our results. 相似文献