全文获取类型
收费全文 | 4740篇 |
免费 | 279篇 |
国内免费 | 8篇 |
专业分类
电工技术 | 58篇 |
综合类 | 8篇 |
化学工业 | 936篇 |
金属工艺 | 55篇 |
机械仪表 | 75篇 |
建筑科学 | 177篇 |
矿业工程 | 5篇 |
能源动力 | 163篇 |
轻工业 | 332篇 |
水利工程 | 53篇 |
石油天然气 | 35篇 |
无线电 | 390篇 |
一般工业技术 | 1189篇 |
冶金工业 | 609篇 |
原子能技术 | 13篇 |
自动化技术 | 929篇 |
出版年
2024年 | 13篇 |
2023年 | 60篇 |
2022年 | 96篇 |
2021年 | 140篇 |
2020年 | 113篇 |
2019年 | 122篇 |
2018年 | 127篇 |
2017年 | 140篇 |
2016年 | 166篇 |
2015年 | 139篇 |
2014年 | 190篇 |
2013年 | 333篇 |
2012年 | 310篇 |
2011年 | 386篇 |
2010年 | 297篇 |
2009年 | 282篇 |
2008年 | 307篇 |
2007年 | 244篇 |
2006年 | 214篇 |
2005年 | 186篇 |
2004年 | 152篇 |
2003年 | 133篇 |
2002年 | 130篇 |
2001年 | 66篇 |
2000年 | 60篇 |
1999年 | 61篇 |
1998年 | 50篇 |
1997年 | 49篇 |
1996年 | 47篇 |
1995年 | 42篇 |
1994年 | 39篇 |
1993年 | 36篇 |
1992年 | 38篇 |
1991年 | 20篇 |
1990年 | 27篇 |
1989年 | 15篇 |
1988年 | 13篇 |
1987年 | 28篇 |
1986年 | 15篇 |
1985年 | 31篇 |
1984年 | 13篇 |
1983年 | 6篇 |
1982年 | 13篇 |
1981年 | 20篇 |
1977年 | 5篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 5篇 |
1973年 | 6篇 |
1964年 | 4篇 |
排序方式: 共有5027条查询结果,搜索用时 0 毫秒
81.
Jonathan Ollar Charles Mortished Royston Jones Johann Sienz Vassili Toropov 《Structural and Multidisciplinary Optimization》2017,55(6):2029-2044
In this work a two step approach to efficiently carrying out hyper parameter optimisation, required for building kriging and gradient enhanced kriging metamodels, is presented. The suggested approach makes use of an initial line search along the hyper-diagonal of the design space in order to find a suitable starting point for a subsequent gradient based optimisation algorithm. During the optimisation an upper bound constraint is imposed on the condition number of the correlation matrix in order to keep it from being ill conditioned. Partial derivatives of both the condensed log likelihood function and the condition number are obtained using the adjoint method, the latter has been derived in this work. The approach is tested on a number of analytical examples and comparisons are made to other optimisation approaches. Finally the approach is used to construct metamodels for a finite element model of an aircraft wing box comprising of 126 thickness design variables and is then compared with a sub-set of the other optimisation approaches. 相似文献
82.
Ariel Felner Uzi Zahavi Robert Holte Jonathan Schaeffer Nathan Sturtevant Zhifu Zhang 《Artificial Intelligence》2011,175(9-10):1570-1603
In the field of heuristic search it is usually assumed that admissible heuristics are consistent, implying that consistency is a desirable attribute. The term “inconsistent heuristic” has, at times, been portrayed negatively, as something to be avoided. Part of this is historical: early research discovered that inconsistency can lead to poor performance for A? (nodes might be re-expanded many times). However, the issue has never been fully investigated, and was not re-considered after the invention of IDA?.This paper shows that many of the preconceived notions about inconsistent heuristics are outdated. The worst-case exponential time of inconsistent heuristics is shown to only occur on contrived graphs with edge weights that are exponential in the size of the graph. Furthermore, the paper shows that rather than being something to be avoided, inconsistent heuristics often add a diversity of heuristic values into a search which can lead to a reduction in the number of node expansions. Inconsistent heuristics are easy to create, contrary to the common perception in the AI literature. To demonstrate this, a number of methods for achieving effective inconsistent heuristics are presented.Pathmax is a way of propagating inconsistent heuristic values in the search from parent to children. This technique is generalized into bidirectional pathmax (BPMX) which propagates values from a parent to a child node, and vice versa. BPMX can be integrated into IDA? and A?. When inconsistent heuristics are used with BPMX, experimental results show a large reduction in the search effort required by IDA?. Positive results are also presented for A? searches. 相似文献
83.
Practical and financial constraints associated with traditional field-based lithological mapping are often responsible for the generation of maps with insufficient detail and inaccurately located contacts. In arid areas with well exposed rocks and soils, high-resolution multi- and hyperspectral imagery is a valuable mapping aid as lithological units can be readily discriminated and mapped by automatically matching image pixel spectra to a set of reference spectra. However, the use of spectral imagery in all but the most barren terrain is problematic because just small amounts of vegetation cover can obscure or mask the spectra of underlying geological substrates. The use of ancillary information may help to improve lithological discrimination, especially where geobotanical relationships are absent or where distinct lithologies exhibit inherent spectral similarity. This study assesses the efficacy of airborne multispectral imagery for detailed lithological mapping in a vegetated section of the Troodos ophiolite (Cyprus), and investigates whether the mapping performance can be enhanced through the integration of LiDAR-derived topographic data. In each case, a number of algorithms involving different combinations of input variables and classification routine were employed to maximise the mapping performance. Despite the potential problems posed by vegetation cover, geobotanical associations aided the generation of a lithological map - with a satisfactory overall accuracy of 65.5% and Kappa of 0.54 - using only spectral information. Moreover, owing to the correlation between topography and lithology in the study area, the integration of LiDAR-derived topographic variables led to significant improvements of up to 22.5% in the overall mapping accuracy compared to spectral-only approaches. The improvements were found to be considerably greater for algorithms involving classification with an artificial neural network (the Kohonen Self-Organizing Map) than the parametric Maximum Likelihood Classifier. The results of this study demonstrate the enhanced capability of data integration for detailed lithological mapping in areas where spectral discrimination is complicated by the presence of vegetation or inherent spectral similarities. 相似文献
84.
Katherine T. Moorhead Jonathan V. HillJ. Geoffrey Chase Christopher E. HannJennifer M. Scotter Malina K. StorerZoltan H. Endre 《Computer methods and programs in biomedicine》2011,101(2):173-182
This paper compares three methods for estimating renal function, as tested in rats. Acute renal failure (ARF) was induced via a 60-min bilateral renal artery clamp in 8 Sprague-Dawley rats and renal function was monitored for 1 week post-surgery. A two-compartment model was developed for estimating glomerular filtration via a bolus injection of a radio-labelled inulin tracer, and was compared with an estimated creatinine clearance method, modified using the Cockcroft-Gault equation for rats. These two methods were compared with selected ion flow tube-mass spectrometry (SIFT-MS) monitoring of breath analytes. Determination of renal function via SIFT-MS is desirable since results are available non-invasively and in real time. Relative decreases in renal function show very good correlation between all 3 methods (R2 = 0.84, 0.91 and 0.72 for breath-inulin, inulin-creatinine, and breath-creatinine correlations, respectively), and indicate good promise for fast, non-invasive determination of renal function via breath testing. 相似文献
85.
The accurate measurement of the execution time of Java bytecode is one factor that is important in order to estimate the total execution time of a Java application running on a Java Virtual Machine. In this paper we document the difficulties and solutions for the accurate timing of Java bytecode. We also identify trends across the execution times recorded for all imperative Java bytecodes. These trends would suggest that knowing the execution times of a small subset of the Java bytecode instructions would be sufficient to model the execution times of the remainder. We first review a statistical approach for achieving high precision timing results for Java bytecode using low precision timers and then present a more suitable technique using homogeneous bytecode sequences for recording such information. We finally compare instruction execution times acquired using this platform independent technique against execution times recorded using the read time stamp counter assembly instruction. In particular our results show the existence of a strong linear correlation between both techniques. 相似文献
86.
Jonathan Alexander Author Vitae 《Computers and Composition》2008,25(1):1-8
The development, dissemination, and proliferation of multimedia and media convergent texts raise a number of pressing questions for literacy scholars in general and compositionists in particular. What kinds of literacy practices are students developing through their use and composition of multimodal and new media texts? What genres are used in the creation of such texts, and why? Are there particular genres that are favored? How are older genres remediated or recast through media convergence? What research methodology challenges are posed when attempting to study multimodal and new media texts? How might compositionists use media convergence to teach students about academic literacies, about research, about the changing nature of “writing?” What might media convergence look like in the future? Perhaps most immediately, the phrase itself—“media convergence”—begs a question: what, exactly, is converging? This special issue of Computers and Composition on “Media Convergence” poses answers—sometimes tentative, sometimes provocative—to these questions. 相似文献
87.
Mashburn DN Hinkson SJ Woods MC Gilligan JM Holcomb MR Wikswo JP 《The Review of scientific instruments》2007,78(10):104302
Defibrillators are a critical tool for treating heart disease; however, the mechanisms by which they halt fibrillation are still not fully understood and are the subject of ongoing research. Clinical defibrillators do not provide the precise control of shock timing, duration, and voltage or other features needed for detailed scientific inquiry, and there are few, if any, commercially available units designed for research applications. For this reason, we have developed a high-voltage, programmable, capacitive-discharge stimulator optimized to deliver defibrillation shocks with precise timing and voltage control to an isolated animal heart, either in air or in a bath. This stimulator is capable of delivering voltages of up to 500 V and energies of nearly 100 J with timing accuracy of a few microseconds and with rise and fall times of 5 micros or less and is controlled only by two external timing pulses and a control computer that sets the stimulation parameters via a LABVIEW interface. Most importantly, the stimulator has circuits to protect the high-voltage circuitry and the operator from programming and input-output errors. This device has been tested and used successfully in field shock experiments on rabbit hearts as well as other protocols requiring high voltage. 相似文献
88.
Re-entrant flow manufacturing lines, such as occur in semiconductor wafer fabrication, are characterized by a product routing that consists of multiple visits to a workstation or group of workstations during the manufacturing process. In this paper, a modeling approach is based on the use of generalized Petri nets for a re-entrant flow manufacturing line is presented. Specifically, three Petri net models representing a re-entrant flow line with three work centers and six machines are modeled. How these models may be used to represent a variety of queuing disciplines and work release policies is discussed. 相似文献
89.
Assessing the quality of use case descriptions 总被引:1,自引:0,他引:1
90.
Similarity-guided streamline placement with error evaluation 总被引:3,自引:0,他引:3
Chen Y Cohen J Krolik J 《IEEE transactions on visualization and computer graphics》2007,13(6):1448-1455
Most streamline generation algorithms either provide a particular density of streamlines across the domain or explicitly detect features, such as critical points, and follow customized rules to emphasize those features. However, the former generally includes many redundant streamlines, and the latter requires Boolean decisions on which points are features (and may thus suffer from robustness problems for real-world data). We take a new approach to adaptive streamline placement for steady vector fields in 2D and 3D. We define a metric for local similarity among streamlines and use this metric to grow streamlines from a dense set of candidate seed points. The metric considers not only Euclidean distance, but also a simple statistical measure of shape and directional similarity. Without explicit feature detection, our method produces streamlines that naturally accentuate regions of geometric interest. In conjunction with this method, we also propose a quantitative error metric for evaluating a streamline representation based on how well it preserves the information from the original vector field. This error metric reconstructs a vector field from points on the streamline representation and computes a difference of the reconstruction from the original vector field. 相似文献