全文获取类型
收费全文 | 16279篇 |
免费 | 2039篇 |
国内免费 | 1635篇 |
专业分类
电工技术 | 1135篇 |
技术理论 | 5篇 |
综合类 | 1709篇 |
化学工业 | 719篇 |
金属工艺 | 237篇 |
机械仪表 | 827篇 |
建筑科学 | 853篇 |
矿业工程 | 212篇 |
能源动力 | 366篇 |
轻工业 | 253篇 |
水利工程 | 338篇 |
石油天然气 | 207篇 |
武器工业 | 166篇 |
无线电 | 1631篇 |
一般工业技术 | 1693篇 |
冶金工业 | 695篇 |
原子能技术 | 69篇 |
自动化技术 | 8838篇 |
出版年
2024年 | 85篇 |
2023年 | 255篇 |
2022年 | 384篇 |
2021年 | 435篇 |
2020年 | 511篇 |
2019年 | 523篇 |
2018年 | 479篇 |
2017年 | 655篇 |
2016年 | 700篇 |
2015年 | 830篇 |
2014年 | 1034篇 |
2013年 | 1304篇 |
2012年 | 1174篇 |
2011年 | 1354篇 |
2010年 | 1024篇 |
2009年 | 1116篇 |
2008年 | 1170篇 |
2007年 | 1177篇 |
2006年 | 989篇 |
2005年 | 817篇 |
2004年 | 683篇 |
2003年 | 561篇 |
2002年 | 486篇 |
2001年 | 389篇 |
2000年 | 327篇 |
1999年 | 227篇 |
1998年 | 197篇 |
1997年 | 165篇 |
1996年 | 142篇 |
1995年 | 120篇 |
1994年 | 95篇 |
1993年 | 76篇 |
1992年 | 77篇 |
1991年 | 55篇 |
1990年 | 48篇 |
1989年 | 44篇 |
1988年 | 30篇 |
1987年 | 17篇 |
1986年 | 20篇 |
1985年 | 16篇 |
1984年 | 13篇 |
1983年 | 14篇 |
1982年 | 21篇 |
1981年 | 14篇 |
1980年 | 14篇 |
1979年 | 8篇 |
1978年 | 10篇 |
1976年 | 6篇 |
1975年 | 7篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 265 毫秒
51.
The present article reports the investigation of the effects of surrounding brightness on a visual search for three safety colors: red, orange, and yellow. Images of visual stimuli consisting of an array of colored circles placed on a large visual field (a visual angle of 40°) were displayed on an 80‐in. screen with a DLP projector. Experiment I examined the search efficiency under three levels of background luminance that were equivalent to the three target luminances. The results showed that the search efficiency for the orange target decreased as the number of distractors increased, under each of the background luminance levels, whereas the efficiency scarcely decreased for the red and yellow targets. Although a reduction in background luminance increased the search efficiency for the orange target, it is suggested that the effect of background luminance is smaller than the effect of the target color in search efficiency. Experiment II examined the search efficiency under three conditions of low levels of incident illuminance, which were matched with a linear regression to the luminance of color chips of safety colors measured twilight conditions. The results showed that the search efficiency for the orange target decreased as the number of distractors increased under each of the different illuminance conditions, whereas the efficiency scarcely decreased for red and yellow targets. Furthermore, as illuminance decreased, the search time for the orange target was more greatly impacted than for red or yellow. These results imply that the recognition of orange tends to be influenced by the surrounding brightness. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 400–409, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20152 相似文献
52.
Parity space approach and H2 approach are two important fault detection approaches. This paper studies the relationship between these two approaches, which reveals frequency domain characteristics of the optimal solution of the parity space approach on the one side and provides a numerical solution of the H2-optimal design of residual generators on the other side. 相似文献
53.
一个基于优化的有限元模型修正方法 总被引:10,自引:5,他引:5
本文提供了一个基于一阶搜索优化的有限元模型修正方法。它只需利用结构模态试验的部分固有频率,就能获得较精确的有限元模型。文中附有某无人机上垂尾有限元模型修正的实例。根据上垂尾前二阶试验的固有频率,采用本文方法,对有限元模型进行了修正。修正后有限元模型的前二阶固有频率与试验值的相对误差在2.35%以内,而第三阶固有频率与试验值的相对误差仅为5.81%。它不仅大大地缩小了用修正前有限元模型算得的固有频率与试验值的相对误差,而且还能较精确地预测无试验结果的高阶固有频率值。 相似文献
54.
This paper deals with fault detection problems in sampled-data (SD) systems. A tool is first introduced for the analysis of intersample behavior of SD systems in the frequency domain from the viewpoint of fault detection and isolation. Based on it, a direct design approach of fault detection systems for SD systems is proposed, and further the problem of full decoupling from unknown disturbances is studied. 相似文献
55.
56.
针对SAT问题的复杂性及求解速度缓慢的问题,采用可重构器件FPGA设计,实现了静态回溯搜索算法SAT问题并行处理器,提出了研制动态SAT并行处理器的设想。 相似文献
57.
Robot Pose Estimation in Unknown Environments by Matching 2D Range Scans 总被引:14,自引:0,他引:14
A mobile robot exploring an unknown environment has no absolute frame of reference for its position, other than features it detects through its sensors. Using distinguishable landmarks is one possible approach, but it requires solving the object recognition problem. In particular, when the robot uses two-dimensional laser range scans for localization, it is difficult to accurately detect and localize landmarks in the environment (such as corners and occlusions) from the range scans.In this paper, we develop two new iterative algorithms to register a range scan to a previous scan so as to compute relative robot positions in an unknown environment, that avoid the above problems. The first algorithm is based on matching data points with tangent directions in two scans and minimizing a distance function in order to solve the displacement between the scans. The second algorithm establishes correspondences between points in the two scans and then solves the point-to-point least-squares problem to compute the relative pose of the two scans. Our methods work in curved environments and can handle partial occlusions by rejecting outliers. 相似文献
58.
Ibrahim H. Osman Nicos Christofides 《International Transactions in Operational Research》1994,1(3):317-336
The capacitated clustering problem (CCP) is the problem in which a given set of weighted objects is to be partitioned into clusters so that the total weight of objects in each cluster is less than a given value (cluster ‘capacity’). The objective is to minimize the total scatter of objects from the ‘centre’ of the cluster to which they have been allocated. A simple constructive heuristic, a R-interchange generation mechanism, a hybrid simulated annealing (SA) and tabu search (TS) algorithm which has computationally desirable features using a new non-monotonic cooling schedule, are developed. A classification of the existing SA cooling schedules is presented. The effects on the final solution quality of the initial solutions, the cooling schedule parameters and the neighbourhood search strategies are investigated. Computational results on randomly generated problems with size ranging from 50 to 100 customers indicate that the hybrid SA/TS algorithm out-performs previous simulated annealing algorithms, a simple tabu search and local descent algorithms. 相似文献
59.
The problem of the non-causal inversion of linear multivariable discrete-time systems is analyzed in the geometric approach framework and is solved through the computation of convolution profiles which guarantee perfect tracking under the assumption of infinite-length preaction and postaction time intervals. It is shown how the shape of the convolution profiles is related to both the relative degree and the invariant zeros of the plant. A computational setting for the convolution profiles is derived by means of the standard geometric approach tools. Feasibility constraints are also taken into account. A possible implementation scheme, based on a finite impulse response system acting on a stabilized control loop, is provided. 相似文献
60.
本文结合为某机械厂开发的实用计算机辅助工艺设计系统(JJCAPP),论述了一种兼有派生式和创成式特点的综合式工艺自动设计方法. 相似文献