全文获取类型
收费全文 | 4107篇 |
免费 | 184篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 36篇 |
综合类 | 6篇 |
化学工业 | 934篇 |
金属工艺 | 39篇 |
机械仪表 | 74篇 |
建筑科学 | 337篇 |
矿业工程 | 12篇 |
能源动力 | 126篇 |
轻工业 | 446篇 |
水利工程 | 45篇 |
石油天然气 | 11篇 |
武器工业 | 1篇 |
无线电 | 266篇 |
一般工业技术 | 644篇 |
冶金工业 | 460篇 |
原子能技术 | 16篇 |
自动化技术 | 840篇 |
出版年
2023年 | 28篇 |
2022年 | 34篇 |
2021年 | 62篇 |
2020年 | 52篇 |
2019年 | 75篇 |
2018年 | 90篇 |
2017年 | 87篇 |
2016年 | 106篇 |
2015年 | 72篇 |
2014年 | 142篇 |
2013年 | 304篇 |
2012年 | 189篇 |
2011年 | 288篇 |
2010年 | 208篇 |
2009年 | 209篇 |
2008年 | 213篇 |
2007年 | 223篇 |
2006年 | 171篇 |
2005年 | 169篇 |
2004年 | 123篇 |
2003年 | 103篇 |
2002年 | 112篇 |
2001年 | 63篇 |
2000年 | 77篇 |
1999年 | 77篇 |
1998年 | 66篇 |
1997年 | 70篇 |
1996年 | 83篇 |
1995年 | 51篇 |
1994年 | 48篇 |
1993年 | 45篇 |
1992年 | 46篇 |
1991年 | 34篇 |
1990年 | 32篇 |
1989年 | 38篇 |
1988年 | 29篇 |
1987年 | 36篇 |
1986年 | 34篇 |
1985年 | 36篇 |
1984年 | 50篇 |
1983年 | 41篇 |
1982年 | 38篇 |
1981年 | 32篇 |
1980年 | 32篇 |
1979年 | 21篇 |
1978年 | 26篇 |
1977年 | 21篇 |
1976年 | 26篇 |
1975年 | 25篇 |
1973年 | 13篇 |
排序方式: 共有4293条查询结果,搜索用时 31 毫秒
91.
92.
93.
The technology profile inventory (TPI) measures attitudes toward computers and the internet. We describe the most recent phase of the construction of the TPI. The studies reported refine and validate the instrument, and we present the final version as an Appendix A. Using a new sample of respondents (N = 394), we replicated the three major factors found previously (Confidence, Approval, and Interest). The TPI scores were related to patterns of information technology (IT) usage and also to gender. To demonstrate the practical utility of the TPI we report (1) results linking TPI scores to behavior during an internet search task; (2) test–retest results obtained as part of a cognitive training experiment using action video games; and (3) results showing that attitudes to IT may be modified by a particular experience with information technology. 相似文献
94.
There is limited research on trade-offs in demand between manual and voice interfaces of embedded and portable technologies. Mehler et al. identified differences in driving performance, visual engagement and workload between two contrasting embedded vehicle system designs (Chevrolet MyLink and Volvo Sensus). The current study extends this work by comparing these embedded systems with a smartphone (Samsung Galaxy S4). None of the voice interfaces eliminated visual demand. Relative to placing calls manually, both embedded voice interfaces resulted in less eyes-off-road time than the smartphone. Errors were most frequent when calling contacts using the smartphone. The smartphone and MyLink allowed addresses to be entered using compound voice commands resulting in shorter eyes-off-road time compared with the menu-based Sensus but with many more errors. Driving performance and physiological measures indicated increased demand when performing secondary tasks relative to ‘just driving’, but were not significantly different between the smartphone and embedded systems.
Practitioner Summary: The findings show that embedded system and portable device voice interfaces place fewer visual demands on the driver than manual interfaces, but they also underscore how differences in system designs can significantly affect not only the demands placed on drivers, but also the successful completion of tasks. 相似文献
95.
Liming Lee Kit Ian Kou Wentao Zhang Jinling Liang 《International journal of systems science》2016,47(10):2466-2474
In this paper, we consider finite-time control problems for linear multi-agent systems subject to exogenous constant disturbances and impulses. Some sufficient conditions are obtained to ensure the finite-time boundedness of the multi-agent systems, which could be then reduced to a feasibility problem involving linear matrix inequalities. Numerical examples are given to illustrate the results. 相似文献
96.
Ian Scott Evans Jessica Miki Jessee Ho Derek T. Robinson 《International journal of remote sensing》2016,37(6):1411-1430
Topographic and elevation data are essential in the development of supporting infrastructure around mining sites. The de facto standard for acquiring elevation data is through light detection and ranging (lidar). The high labour and monetary cost of acquiring lidar has fostered more cost-effective approaches for creating elevation models that use stereo photogrammetry. To assess the accuracy of stereo-photogrammetry-derived elevation models and their potential application, we benchmark satellite (Worldview-2) and aircraft (South Central Ontario Orthoimagery Project; SCOOP) stereo-derived digital surface models (DSMs) against a lidar-derived DSM. Our results show that both stereo-derived DSMs have strong monotonic correlations with lidar across a range of land-cover types and slopes. The overall vertical accuracy of Worldview-2 and SCOOP DSMs are similar and do not meet the United States National Digital Elevation Program (NDEP) standards. However, accuracy assessment across land-cover types and slope categories show that specific land cover types (i.e. grass, row crops/pasture, sparse vegetation and marsh) on gently sloping terrain compare well to lidar data and meet NDEP accuracy standards. We situate the presented research in the context of northern resource development and discuss opportunities to improve the vertical accuracy of stereo-derived DSMs, for example, through unmanned aerial systems. 相似文献
97.
Ian J. Hayes 《Formal Aspects of Computing》2016,28(6):1057-1078
The rely-guarantee technique allows one to reason compositionally about concurrent programs. To handle interference the technique makes use of rely and guarantee conditions, both of which are binary relations on states. A rely condition is an assumption that the environment performs only atomic steps satisfying the rely relation and a guarantee is a commitment that every atomic step the program makes satisfies the guarantee relation. In order to investigate rely-guarantee reasoning more generally, in this paper we allow interference to be represented by a process rather than a relation and hence derive more general rely-guarantee laws. The paper makes use of a weak conjunction operator between processes, which generalises a guarantee relation to a guarantee process, and introduces a rely quotient operator, which generalises a rely relation to a process. The paper focuses on the algebraic properties of the general rely-guarantee theory. The Jones-style rely-guarantee theory can be interpreted as a model of the general algebraic theory and hence the general laws presented here hold for that theory. 相似文献
98.
This paper presents a systematic approach to the design of a nonlinear robust dynamic state feedback controller for nonlinear uncertain systems using copies of the plant nonlinearities. The technique is based on the use of integral quadratic constraints and minimax linear quadratic regulator control, and uses a structured uncertainty representation. The approach combines a linear state feedback guaranteed cost controller and copies of the plant nonlinearities to form a robust nonlinear controller with a novel control architecture. A nonlinear state feedback controller is designed for a synchronous machine using the proposed method. The design provides improved stability and transient response in the presence of uncertainty and nonlinearity in the system and also provides a guaranteed bound on the cost function. An automatic voltage regulator to track reference terminal voltage is also provided by a state feedback equivalent robust nonlinear proportional integral controller. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
99.
In this paper we give a formal definition of the requirements translation language Behavior Trees. This language has been used with success in industry to systematically translate large, complex, and often erroneous requirements documents into a structured model of the system. It contains a mixture of state-based manipulations, synchronisation, message passing, and parallel, conditional, and iterative control structures. The formal semantics of a Behavior Tree is given via a translation to a version of Hoare’s process algebra CSP, extended with state-based constructs such as guards and updates, and a message passing facility similar to that used in publish/subscribe protocols. We first provide the extension of CSP and its operational semantics, which preserves the meaning of the original CSP operators, and then the Behavior Tree notation and its translation into the extended version of CSP. 相似文献
100.
We study the problem of maintaining a dynamic ordered tree succinctly under updates of the following form: insertion or deletion of a leaf, insertion of a node on an edge (edge subdivision) or deletion of a node with only one child (the child becomes a child of its former grandparent). We allow satellite data of a fixed size to be associated to the nodes of the tree.We support update operations in constant amortized time and support access to satellite data and basic navigation operations in worst-case constant time; the basic navigation operations include parent, first/last-child, previous/next-child. These operations are moving from a node to its parent, leftmost/rightmost child, and its previous and next child respectively.We demonstrate that to efficiently support more extended operations, such as determining the i-th child of a node, rank of a child among its siblings, or size of the subtree rooted at a node, one requires a restrictive pattern for update strategy, for which we propose the finger-update model. In this model, updates are performed at the location of a finger that is only allowed to crawl on the tree between a child and a parent or between consecutive siblings. Under this model, we describe how the named extended operations are performed in worst-case constant time.Previous work on dynamic succinct trees (Munro et al., 2001 [17]; Raman and Rao, 2003 [19]) is mainly restricted to binary trees and achieves poly-logarithmic (Munro et al., 2001 [17]) or “poly-log-log” (Raman and Rao, 2003 [19]) update time under a more restricted model, where updates are performed in traversals starting at the root and ending at the root and queries can be answered when the traversal is completed. A previous result on ordinal trees achieves only sublinear amortized update time and “poly-log-log” query time (Gupta et al., 2007 [11]). More recently, the update time has been improved to O(logn/loglogn) while queries can be performed in O(logn/loglogn) time (Sadakane and Navarro, 2010 [20]). 相似文献