全文获取类型
收费全文 | 17023篇 |
免费 | 501篇 |
国内免费 | 29篇 |
专业分类
电工技术 | 211篇 |
综合类 | 14篇 |
化学工业 | 3621篇 |
金属工艺 | 323篇 |
机械仪表 | 360篇 |
建筑科学 | 704篇 |
矿业工程 | 98篇 |
能源动力 | 458篇 |
轻工业 | 1204篇 |
水利工程 | 196篇 |
石油天然气 | 120篇 |
无线电 | 1023篇 |
一般工业技术 | 2854篇 |
冶金工业 | 3476篇 |
原子能技术 | 147篇 |
自动化技术 | 2744篇 |
出版年
2023年 | 104篇 |
2022年 | 180篇 |
2021年 | 259篇 |
2020年 | 204篇 |
2019年 | 209篇 |
2018年 | 300篇 |
2017年 | 279篇 |
2016年 | 317篇 |
2015年 | 301篇 |
2014年 | 435篇 |
2013年 | 1125篇 |
2012年 | 718篇 |
2011年 | 894篇 |
2010年 | 655篇 |
2009年 | 657篇 |
2008年 | 804篇 |
2007年 | 749篇 |
2006年 | 689篇 |
2005年 | 610篇 |
2004年 | 544篇 |
2003年 | 465篇 |
2002年 | 471篇 |
2001年 | 313篇 |
2000年 | 278篇 |
1999年 | 301篇 |
1998年 | 346篇 |
1997年 | 314篇 |
1996年 | 294篇 |
1995年 | 248篇 |
1994年 | 270篇 |
1993年 | 236篇 |
1992年 | 242篇 |
1991年 | 164篇 |
1990年 | 211篇 |
1989年 | 221篇 |
1988年 | 173篇 |
1987年 | 208篇 |
1986年 | 179篇 |
1985年 | 207篇 |
1984年 | 218篇 |
1983年 | 181篇 |
1982年 | 177篇 |
1981年 | 142篇 |
1980年 | 134篇 |
1979年 | 144篇 |
1978年 | 119篇 |
1977年 | 145篇 |
1976年 | 126篇 |
1975年 | 120篇 |
1974年 | 109篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
11.
12.
Tested the ability of 4 adult male Sprague-Dawley rats to use odors in discrimination among littermates living as a group. Ss were trained in a Y-maze to discriminate the presence of a littermate from its absence. Results from transfer of training in 3 subsequent testing periods indicated that the animals were capable of distinguishing among individuals when relatedness and familiarity were held constant, that this ability was not due to training, and that performance was based solely on odor cues. Results suggest that laboratory rats exhibit odor sensitivities conmensurate with very complex social processes. (17 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
14.
Steven Y. Susswein Thomas C. Henderson Joseph L. Zachary Chuck Hansen Paul Hinker Gary C. Marsden 《International journal of parallel programming》1991,20(6):453-473
Filtering algorithms are well accepted as a means of speeding up the solution of the consistent labeling problem (CLP). Despite the fact that path consistency does a better job of filtering than arc consistency, AC is still the preferred technique because it has a much lower time complexity. We are implementing parallel path consistency algorithms on multiprocessors and comparing their performance to the best sequential and parallel arc consistency algorithms.(1,2) (See also work by Kerethoet al.
(3) and Kasif(4)) Preliminary work has shown linear performance increases for parallelized path consistency and also shown that in many cases performance is significantly better than the theoretical worst case. These two results lead us to believe that parallel path consistency may be a superior filtering technique. Finally, we have implemented path consistency as an outer product computation and have obtained good results (e.g., linear speedup on a 64K-node Connection Machine 2). 相似文献
15.
On sorting triangles in a delaunay tessellation 总被引:1,自引:0,他引:1
In a two-dimensional Delaunay-triangulated domain, there exists a partial ordering of the triangles (with respect to a vertex) that is consistent with the two-dimensional visibility of the triangles from that vertex. An equivalent statement is that a polygon that is star-shaped with respect to a given vertex can be extended, one triangle at a time, until it includes the entire domain. Arbitrary planar triangulations do not possess this useful property which allows incremental processing of the triangles.This work was partially supported by the National Science Foundation's US-Italy Collaborative Research Program under Grant INT-8714578 and Information, Robotics, and Intelligent Research Grant IRI-8704781. 相似文献
16.
Steven S. Ross 《网络电信》2008,(8):13-13
Perhaps the most powerful claim that advocates of fiber can make,on top of the massive bandwidthfiber makes possible today, is that fiber is future-proof. That is, the fiber that is laid today can be upgraded so that the same strands of glass can carry massively more bandwidth in the future. 相似文献
17.
18.
Otis Smart Hiram Firpi George Vachtsevanos 《Engineering Applications of Artificial Intelligence》2007,20(8):1070-1085
This paper presents an application of genetic programming (GP) to optimally select and fuse conventional features (C-features) for the detection of epileptic waveforms within intracranial electroencephalogram (IEEG) recordings that precede seizures, known as seizure precursors. Evidence suggests that seizure precursors may localize regions important to seizure generation on the IEEG and epilepsy treatment. However, current methods to detect epileptic precursors lack a sound approach to automatically select and combine C-features that best distinguish epileptic events from background, relying on visual review predominantly. This work suggests GP as an optimal alternative to create a single feature after evaluating the performance of a binary detector that uses: (1) genetically programmed features; (2) features selected via GP; (3) forward sequentially selected features; and (4) visually selected features. Results demonstrate that a detector with a genetically programmed feature outperforms the other three approaches, achieving over 78.5% positive predictive value, 83.5% sensitivity, and 93% specificity at the 95% level of confidence. 相似文献
19.
This study examined whether objects are attended in serial or in parallel during a demanding visual search task. A component of the event-related potential waveform, the N2pc wave, was used as a continuous measure of the allocation of attention to possible targets in the search arrays. Experiment 1 demonstrated that the relative allocation of attention shifts rapidly, favoring one item and then another. In Experiment 2, a paradigm was used that made it possible to track the absolute allocation of attention to individual items. This experiment showed that attention was allocated to one object for 100-150 ms before attention began to be allocated to the next object. These findings support models of attention that posit serial processing in demanding visual search tasks. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
20.
We consider an integrated scheduling and distribution model in which jobs completed by two different machines must be bundled together for delivery. The objective is to minimize the sum of the delivery cost and customers' waiting costs. Such a model not only attempts to coordinate the job schedules on both machines, but also aims to coordinate the machine schedules with the delivery plan. Polynomial-time heuristics and approximation schemes are developed for the model with only direct shipments as well as the general model with milk-run deliveries. 相似文献