全文获取类型
收费全文 | 2990篇 |
免费 | 265篇 |
国内免费 | 75篇 |
专业分类
电工技术 | 154篇 |
综合类 | 165篇 |
化学工业 | 357篇 |
金属工艺 | 53篇 |
机械仪表 | 111篇 |
建筑科学 | 242篇 |
矿业工程 | 17篇 |
能源动力 | 60篇 |
轻工业 | 99篇 |
水利工程 | 69篇 |
石油天然气 | 37篇 |
武器工业 | 8篇 |
无线电 | 384篇 |
一般工业技术 | 256篇 |
冶金工业 | 55篇 |
原子能技术 | 81篇 |
自动化技术 | 1182篇 |
出版年
2023年 | 11篇 |
2022年 | 26篇 |
2021年 | 37篇 |
2020年 | 61篇 |
2019年 | 62篇 |
2018年 | 71篇 |
2017年 | 61篇 |
2016年 | 86篇 |
2015年 | 115篇 |
2014年 | 116篇 |
2013年 | 125篇 |
2012年 | 132篇 |
2011年 | 222篇 |
2010年 | 144篇 |
2009年 | 191篇 |
2008年 | 202篇 |
2007年 | 195篇 |
2006年 | 137篇 |
2005年 | 148篇 |
2004年 | 164篇 |
2003年 | 224篇 |
2002年 | 149篇 |
2001年 | 139篇 |
2000年 | 78篇 |
1999年 | 50篇 |
1998年 | 32篇 |
1997年 | 34篇 |
1996年 | 47篇 |
1995年 | 33篇 |
1994年 | 41篇 |
1993年 | 17篇 |
1992年 | 20篇 |
1991年 | 24篇 |
1990年 | 16篇 |
1989年 | 8篇 |
1988年 | 12篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 18篇 |
1984年 | 17篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1979年 | 2篇 |
1978年 | 8篇 |
1977年 | 3篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1974年 | 4篇 |
1965年 | 1篇 |
排序方式: 共有3330条查询结果,搜索用时 15 毫秒
81.
82.
Trust mechanisms are used in peer‐to‐peer (P2P) networks to help well‐behaving peers find other well‐behaving peers with which to trade. Unfortunately, these trust mechanisms often do little to keep badly behaving peers from entering and taking advantage of the network, which makes the resulting network difficult or impossible to use for legitimate purposes such as e‐commerce. We propose trust by association, a way of tying peers together in invitation‐only P2P networks in such a way as to encourage the removal of badly behaving peers. We use invitations to create a structure within the otherwise ad hoc P2P network. Using this structure, we create a meta‐reputation system where we measure a peer’s trustworthiness not only by its own behavior, but also by the behavior of the peers it has invited to join. The connection created between the peers takes advantage of the external social relationship that must exist before a peer can be invited into the network. The result is a P2P network where, rather than just trying to marginalize badly behaving peers, there is incentive to kick them out of the network. We present results from a simple simulation showing that our approach works well in general when combined with and compared to an existing trust mechanism. 相似文献
83.
In this paper, by constructing various kinds of sub- and super-solutions and using the basic properties of M-matrix, we give the necessary and sufficient conditions of global existence for nonnegative solutions to a degenerate parabolic system with completely coupled boundary conditions, which generalize the recent results of, for instance, Cui [Z. Cui, Critical curves of the non-Newtonian polytropic filtration equations coupled with nonlinear boundary conditions, Nonlinear Anal. 68 (2008) 3201–3208], Zhou–Mu [J. Zhou, C. Mu, Algebraic criteria for global existence or blow-up for a boundary coupled system of nonlinear diffusion equations, Appl. Anal. 86 (2007) 1185–1197] etc. 相似文献
84.
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. 相似文献
85.
86.
Step sequence planning for a biped robot by means of a cylindrical shape model and a high-resolution 2.5D map 总被引:1,自引:0,他引:1
Robert CupecAuthor Vitae Ivan AleksiAuthor VitaeGünther SchmidtAuthor Vitae 《Robotics and Autonomous Systems》2011,59(2):84-100
A novel step sequence planning (SSP) method for biped-walking robots is presented. The method adopts a free space representation custom-designed for efficient biped robot motion planning. The method rests upon the approximation of the robot shape by a set of 3D cylindrical solids. This feature allows efficient determination of feasible paths in a 2.5D map, comprising stepping over obstacles and stair climbing. A SSP algorithm based on A∗-search is proposed which uses the advantages of the aforementioned environment representation. The efficiency of the proposed approach is evaluated by a series of simulations performed for eight walking scenarios. 相似文献
87.
The satisfiability problem is a basic core NP-complete problem. In recent years, a lot of heuristic algorithms have been developed to solve this problem, and many experiments have evaluated and compared the performance of different heuristic algorithms. However, rigorous theoretical analysis and comparison are rare. This paper analyzes and compares the expected runtime of three basic heuristic algorithms: RandomWalk, (1+1) EA, and hybrid algorithm. The runtime analysis of these heuristic algorithms on two 2-SAT instances shows that the expected runtime of these heuristic algorithms can be exponential time or polynomial time. Furthermore, these heuristic algorithms have their own advantages and disadvantages in solving different SAT instances. It also demonstrates that the expected runtime upper bound of RandomWalk on arbitrary k-SAT (k?3) is O(n(k−1)), and presents a k-SAT instance that has Θ(n(k−1)) expected runtime bound. 相似文献
88.
Chunling Du Author Vitae Lihua Xie Author Vitae Author Vitae Youyi Wang Author Vitae 《Automatica》2009,45(10):2244-2249
This paper is concerned with the rejection of multiple narrowband disturbances in hard disk drives (HDDs). Inspired by a control blending idea, the multi-frequency disturbance rejection is formulated as a blending control problem. Each disturbance rejection is accomplished by using the H2 optimal control method. Based on all H2 optimal controllers, the blending technique is applied to yield a single controller which is capable of achieving rejection of all disturbances. Rejections of two and three disturbances for a 1.8-inch HDD VCM actuator are taken as application examples in the paper. Simulation and experimental results show that the ultimate controller results in a simultaneous attenuation of disturbances with frequencies higher or lower than the closed-loop system bandwidth. Moreover, the method turns out to be able to lift phase and thus prevent phase margin loss when it is used to deal with disturbances near bandwidth. 相似文献
89.
Observer-based networked control for continuous-time systems with random sensor delays 总被引:3,自引:0,他引:3
This paper is concerned with the networked control system design for continuous-time systems with random measurement, where the measurement channel is assumed to subject to random sensor delay. A design scheme for the observer-based output feedback controller is proposed to render the closed-loop networked system exponentially mean-square stable with H∞ performance requirement. The technique employed is based on appropriate delay systems approach combined with a matrix variable decoupling technique. The design method is fulfilled through solving linear matrix inequalities. A numerical example is used to verify the effectiveness and the merits of the present results. 相似文献
90.
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. 相似文献