全文获取类型
收费全文 | 73166篇 |
免费 | 13366篇 |
国内免费 | 9795篇 |
专业分类
电工技术 | 8624篇 |
技术理论 | 1篇 |
综合类 | 9208篇 |
化学工业 | 1439篇 |
金属工艺 | 1317篇 |
机械仪表 | 5426篇 |
建筑科学 | 1275篇 |
矿业工程 | 994篇 |
能源动力 | 1434篇 |
轻工业 | 710篇 |
水利工程 | 1143篇 |
石油天然气 | 832篇 |
武器工业 | 1272篇 |
无线电 | 13012篇 |
一般工业技术 | 4725篇 |
冶金工业 | 816篇 |
原子能技术 | 277篇 |
自动化技术 | 43822篇 |
出版年
2024年 | 594篇 |
2023年 | 1338篇 |
2022年 | 2494篇 |
2021年 | 2714篇 |
2020年 | 3027篇 |
2019年 | 2545篇 |
2018年 | 2522篇 |
2017年 | 3011篇 |
2016年 | 3444篇 |
2015年 | 4088篇 |
2014年 | 5278篇 |
2013年 | 5145篇 |
2012年 | 6323篇 |
2011年 | 6592篇 |
2010年 | 5337篇 |
2009年 | 5503篇 |
2008年 | 5867篇 |
2007年 | 6248篇 |
2006年 | 4897篇 |
2005年 | 4055篇 |
2004年 | 3234篇 |
2003年 | 2561篇 |
2002年 | 1923篇 |
2001年 | 1531篇 |
2000年 | 1290篇 |
1999年 | 978篇 |
1998年 | 796篇 |
1997年 | 630篇 |
1996年 | 493篇 |
1995年 | 347篇 |
1994年 | 298篇 |
1993年 | 228篇 |
1992年 | 217篇 |
1991年 | 113篇 |
1990年 | 138篇 |
1989年 | 100篇 |
1988年 | 71篇 |
1987年 | 29篇 |
1986年 | 40篇 |
1985年 | 40篇 |
1984年 | 26篇 |
1983年 | 32篇 |
1982年 | 39篇 |
1981年 | 23篇 |
1980年 | 31篇 |
1979年 | 15篇 |
1978年 | 15篇 |
1977年 | 12篇 |
1975年 | 16篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 9 毫秒
21.
22.
23.
《C语言程序设计》课堂教学方法的探讨 总被引:1,自引:0,他引:1
王宏林 《数字社区&智能家居》2007,2(6):1440-1440,1455
《C语言程序设计》一直是计算机专业及相关专业的专业基础课。该课程既难教又难学。传统的教学方法往往过分注重语法形式的介绍,却忽视了算法的讲解,使得学生无法解决一些实际编程,也很容易挫伤学生的学习兴趣。为此应以算法教学为主。因材施教,合理使用教材,在改用多媒体教学的同时,适当配以板书。调动学生的主观能动性,提高其编程能力。 相似文献
24.
一种改进的共同进化遗传算法及其应用 总被引:2,自引:0,他引:2
将共同进化遗传算法应用于临床营养决策优化中,虽然取得了一定成果,但算法中仍存在早熟现象、局部搜索能量弱等问题,为此提出一种改进的共同进化模型。算法使用新的子群体划分方法和交叉算子,引入精英保留策略、信息交换原则和小生境技术。通过对糖尿病营养治疗的仿真表明,改进后的算法在保证群体多样性和避免早熟现象的前提下,提高了算法的局部和全局寻优能力,且膳食配方中营养素达标率符合要求,满足专家建议的糖尿病饮食需求。 相似文献
25.
Joon C. Park Author Vitae Author Vitae 《Computer aided design》2003,35(9):807-812
Presented in this paper is a topology reconstruction algorithm from a set of unorganized trimmed surfaces. Error-prone small geometric elements are handled to give proper topological information. It gives complete topology to topologically complete models, and it is also tolerant to incomplete models. The proposed algorithm is vertex-based in that clues for topological information are searched from the set of vertices first, not from that of edges. 相似文献
26.
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) 相似文献
27.
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) 相似文献
28.
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 相似文献
29.
Data fitting with a spline using a real-coded genetic algorithm 总被引:2,自引:0,他引:2
Fujiichi Yoshimoto Author Vitae Toshinobu Harada Author Vitae Author Vitae 《Computer aided design》2003,35(8):751-760
To obtain a good approximation for data fitting with a spline, frequently we have to deal with knots as variables. The problem to be solved then becomes a continuous nonlinear and multivariate optimization problem with many local optima. Therefore, it is difficult to obtain the global optimum. In this paper, we propose a method for solving this problem by using a real-coded genetic algorithm. Our method can treat not only data with a smooth underlying function, but also data with an underlying function having discontinuous points and/or cusps. We search for the best model among candidate models by using the Bayes Information Criterion (BIC). With this, we can appropriately determine the number and locations of knots automatically and simultaneously. Five examples of data fitting are given to show the performance of our method. 相似文献
30.