全文获取类型
收费全文 | 72830篇 |
免费 | 13445篇 |
国内免费 | 9779篇 |
学科分类
工业技术 | 96054篇 |
出版年
2024年 | 586篇 |
2023年 | 1334篇 |
2022年 | 2492篇 |
2021年 | 2710篇 |
2020年 | 3023篇 |
2019年 | 2539篇 |
2018年 | 2518篇 |
2017年 | 3005篇 |
2016年 | 3435篇 |
2015年 | 4080篇 |
2014年 | 5270篇 |
2013年 | 5138篇 |
2012年 | 6307篇 |
2011年 | 6579篇 |
2010年 | 5329篇 |
2009年 | 5492篇 |
2008年 | 5846篇 |
2007年 | 6232篇 |
2006年 | 4881篇 |
2005年 | 4039篇 |
2004年 | 3223篇 |
2003年 | 2551篇 |
2002年 | 1915篇 |
2001年 | 1519篇 |
2000年 | 1281篇 |
1999年 | 967篇 |
1998年 | 787篇 |
1997年 | 628篇 |
1996年 | 490篇 |
1995年 | 345篇 |
1994年 | 296篇 |
1993年 | 228篇 |
1992年 | 214篇 |
1991年 | 112篇 |
1990年 | 138篇 |
1989年 | 100篇 |
1988年 | 71篇 |
1987年 | 28篇 |
1986年 | 40篇 |
1985年 | 39篇 |
1984年 | 26篇 |
1983年 | 32篇 |
1982年 | 38篇 |
1981年 | 23篇 |
1980年 | 31篇 |
1979年 | 15篇 |
1978年 | 15篇 |
1977年 | 12篇 |
1975年 | 16篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
41.
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) 相似文献
42.
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) 相似文献
43.
44.
针对传统的非锐化掩模算法的局限性,依据图像中各像素点及以其为中心的若干相邻像素点的均方差值,提出了自适应图像增强算法的原理,并分析其硬件实现方法,然后给出了该算法与其它算法应用于图像增强的对比结果,最后在FPGA(field programmable gate array)实验板上进行验证.实验结果表明,此算法有效的增强图像的细节区域,防止图像边缘区域出现过冲现象,抑制图像平坦区域的噪声放大.因此,该算法取得了良好的视觉效果,硬件实现简单,适合于实时条件下图像的增强. 相似文献
45.
A weighting algorithm to determine the coordinates of the center of a Gaussian laser beam projected onto a matrix photodetector is considered. The influence of the internal noise of the photodetector, the maximum brightness of the signal at the beam maximum, and the beam radius on the precision of the algorithm is investigated. Recommendations on image processing are presented. 相似文献
46.
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 相似文献
47.
48.
49.
针对一类特殊而不能直接对其观察的管道(如动物的血管),为了准确了解其内部特征和形态,借助计算机给出了一种用腐蚀算法来重建管道原形的方法。这种方法简单易行,而且精确度高。 相似文献
50.
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. 相似文献