全文获取类型
收费全文 | 12433篇 |
免费 | 1531篇 |
国内免费 | 1240篇 |
专业分类
电工技术 | 804篇 |
综合类 | 965篇 |
化学工业 | 593篇 |
金属工艺 | 323篇 |
机械仪表 | 1219篇 |
建筑科学 | 202篇 |
矿业工程 | 118篇 |
能源动力 | 299篇 |
轻工业 | 376篇 |
水利工程 | 92篇 |
石油天然气 | 82篇 |
武器工业 | 122篇 |
无线电 | 1346篇 |
一般工业技术 | 1134篇 |
冶金工业 | 394篇 |
原子能技术 | 41篇 |
自动化技术 | 7094篇 |
出版年
2024年 | 98篇 |
2023年 | 222篇 |
2022年 | 371篇 |
2021年 | 395篇 |
2020年 | 425篇 |
2019年 | 416篇 |
2018年 | 375篇 |
2017年 | 534篇 |
2016年 | 522篇 |
2015年 | 631篇 |
2014年 | 789篇 |
2013年 | 1102篇 |
2012年 | 896篇 |
2011年 | 1030篇 |
2010年 | 753篇 |
2009年 | 852篇 |
2008年 | 919篇 |
2007年 | 843篇 |
2006年 | 678篇 |
2005年 | 579篇 |
2004年 | 490篇 |
2003年 | 403篇 |
2002年 | 334篇 |
2001年 | 290篇 |
2000年 | 240篇 |
1999年 | 152篇 |
1998年 | 137篇 |
1997年 | 121篇 |
1996年 | 100篇 |
1995年 | 83篇 |
1994年 | 69篇 |
1993年 | 61篇 |
1992年 | 41篇 |
1991年 | 36篇 |
1990年 | 30篇 |
1989年 | 30篇 |
1988年 | 22篇 |
1987年 | 16篇 |
1986年 | 11篇 |
1985年 | 15篇 |
1984年 | 4篇 |
1983年 | 11篇 |
1982年 | 15篇 |
1981年 | 12篇 |
1980年 | 12篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n
2
log
n) toO(n log2
n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296. 相似文献
22.
W.R. Jong T.H. Kuo S.W. Ho H.H. Chiu S.H. Peng 《International Communications in Heat and Mass Transfer》2007
Capillary phenomena was studied and discussed by the scholars about 200 years ago, but the progress was slow due to the limited equipment and manufacture precision of the microchannel. In recent years, because of the rapid development of MEMS and micromachining, many applications of the capillary flow is widely developing in some modern processes, such as underfilling of flip chip, flow in microfluidic chip or biochip, and a variety of other fields. 相似文献
23.
Braithwaite Jason J.; Humphreys Glyn W.; Hodsoll John 《Canadian Metallurgical Quarterly》2003,29(4):758
Five experiments addressed the role of color grouping in preview search (D. G. Watson & G. W. Humphreys, 1997). Experiment 1 used opposite color ratios of distractors in preview and second search displays, creating equal numbers of distractors in each color group in the final display. There was selective slowing for new targets carrying the majority color of the old items. This effect held when there was no bias in the preview and only the second search set had an uneven color ratio (Experiment 2). In Experiment 3, participants had foreknowledge of the target color, and effects were shown over and above those due to color biases. Experiment 4 demonstrated negative color carryover even when previews changed color. Experiment 5 showed reduced color carryover effects when previews were presented more briefly. Collectively, the results provide evidence for inhibitory carryover effects in preview search based on feature grouping. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
24.
The authors used visual search tasks in which components of the classic flanker task (B. A. Eriksen & C. W. Eriksen, 1974) were introduced. In several experiments the authors obtained evidence of parallel search for a target among distractor elements. Therefore, 2-stage models of visual search predict no effect of the identity of those distractors. However, clear compatibility effects of the distractors were obtained: Responses were faster when the distractors were compatible with the response than when they were incompatible. These results show that even in parallel search tasks identity information is extracted from the distractors. In addition, alternative interpretations of the results in terms of the occasional identification of a distractor before or after the target was identified could be ruled out. The results showed that flat search slopes obtained in visual search experiments provide no benchmark for preattentive processing. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
25.
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 相似文献
26.
The present paper is devoted to the analysis of the contact problems with Coulomb friction and large deformation between two hyperelastic bodies. One approach to separate the material nonlinearity and contact nonlinearity is presented. The total Lagrangian formulation is adopted to describe the geometrically nonlinear behavior. Nondifferentiable contact potentials are regularized by means of the augmented Lagrangian method. Numerical examples are carried out in two cases: rigid-deformable contact and deformable-deformable contact with large slips. The numerical results prove that the proposed approach is robust and efficient concerning numerical stability. 相似文献
27.
28.
针对SAT问题的复杂性及求解速度缓慢的问题,采用可重构器件FPGA设计,实现了静态回溯搜索算法SAT问题并行处理器,提出了研制动态SAT并行处理器的设想。 相似文献
29.
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. 相似文献
30.
This study is based on a theoretical and photoelastic static contact stress analysis, relevant to the design of the plastic tibial plateau in an orthopaedic knee prosthesis. It involves the review of existing theoretical analyses concerned with the contact mechanics of layered elastic systems and, where possible, the validation of any relevant findings using two dimensional photoelasticity. Significant findings include the identification of a general minimum recommendable design thickness for the plastic tibial plateau, the endorsement of using the Hertzian contact theory to predict contact stress levels in the tibial plateau of certain knee implants and the slight improvement in contact conditions in the plastic when the plateau is perfectly bonded to its supporting metal tray. 相似文献