全文获取类型
收费全文 | 2634篇 |
免费 | 127篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 32篇 |
综合类 | 11篇 |
化学工业 | 373篇 |
金属工艺 | 141篇 |
机械仪表 | 122篇 |
建筑科学 | 110篇 |
矿业工程 | 12篇 |
能源动力 | 57篇 |
轻工业 | 265篇 |
水利工程 | 11篇 |
石油天然气 | 10篇 |
无线电 | 325篇 |
一般工业技术 | 413篇 |
冶金工业 | 381篇 |
原子能技术 | 13篇 |
自动化技术 | 489篇 |
出版年
2023年 | 17篇 |
2022年 | 33篇 |
2021年 | 64篇 |
2020年 | 33篇 |
2019年 | 53篇 |
2018年 | 63篇 |
2017年 | 66篇 |
2016年 | 88篇 |
2015年 | 59篇 |
2014年 | 87篇 |
2013年 | 178篇 |
2012年 | 110篇 |
2011年 | 146篇 |
2010年 | 114篇 |
2009年 | 148篇 |
2008年 | 135篇 |
2007年 | 122篇 |
2006年 | 131篇 |
2005年 | 131篇 |
2004年 | 95篇 |
2003年 | 95篇 |
2002年 | 83篇 |
2001年 | 45篇 |
2000年 | 37篇 |
1999年 | 48篇 |
1998年 | 100篇 |
1997年 | 71篇 |
1996年 | 68篇 |
1995年 | 52篇 |
1994年 | 28篇 |
1993年 | 46篇 |
1992年 | 21篇 |
1991年 | 16篇 |
1990年 | 17篇 |
1989年 | 17篇 |
1988年 | 12篇 |
1987年 | 13篇 |
1986年 | 17篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1983年 | 11篇 |
1982年 | 7篇 |
1980年 | 5篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1977年 | 5篇 |
1976年 | 15篇 |
1975年 | 6篇 |
1973年 | 5篇 |
1972年 | 4篇 |
排序方式: 共有2765条查询结果,搜索用时 750 毫秒
61.
The first measurement of a turnover rate with respect to surface intermediate concentration in a high pressure heterogeneous catalytic reaction is reported. By using infrared-visible sum frequency generation to study the hydrogenation of ethylene on Pt(111), it was found that the surface concentration of -bonded ethylene, the key reaction intermediate, represented approximately 4% of a monolayer. Thus the absolute turnover rate per surface adsorbed ethylene molecule is 25 times faster than the rate measured per platinum atom. To explain these results, we propose a model of weakly adsorbed ethylene intermediates reacting on atop sites. 相似文献
62.
Ron Koster Albert C. Van der Woerd Wouter A. Serdijn Jan Davidse Arthur H. M. Van Roermund 《Analog Integrated Circuits and Signal Processing》1996,9(3):207-214
In this paper design rules for a circuit topology in which there is an inseparable combination of an amplifier and a filter characteristic, are presented. By intentionally using the capacitance of an already present input sensor for the filtering, the total required integrated capacitance is much less than that in circuits, which have a separately designed amplifier and filter function. Consequently, it is possible to have the advantage of a better integratability. Moreover, less complexity in the design is achieved. The presented circuit shows a current-to-voltage conversion and an inherently controllable second-order low-pass filter characteristic. A discrete realization has been designed to test the circuit. This circuit operates down to a 1 V supply voltage and the transfer shows a 1.8 M currentto-voltage conversion with a bandwidth of 6 kHz. Measurement results of this circuit show that a 63 dB dynamic range can be achieved with a total required integrated capacitance of only 31 pF. 相似文献
63.
Ron Martin说:新技术是现代工业网络中的信息技术(IT)和操作技术(OT)的界限越来越模糊。因此,各方组织机构正在寻找能够监控他们以太网网络的新方法。 相似文献
64.
Marc Secanell Ron Songprakorp Ned Djilali Afzal Suleman 《Structural and Multidisciplinary Optimization》2010,40(1-6):563-583
A computational framework for fuel cell analysis and optimization is presented as an innovative alternative to the time consuming trial-and-error process currently used for fuel cell design. The framework is based on a two-dimensional through-the-channel isothermal, isobaric and single phase membrane electrode assembly (MEA) model. The model input parameters are the manufacturing parameters used to build the MEA: platinum loading, platinum to carbon ratio, electrolyte content and gas diffusion layer porosity. The governing equations of the fuel cell model are solved using Netwon’s algorithm and an adaptive finite element method in order to achieve near quadratic convergence and a mesh independent solution respectively. The analysis module is used to solve the optimization problem of finding the optimal MEA composition for maximizing performance. To solve the optimization problem a gradient-based optimization algorithm is used in conjunction with analytical sensitivities. By using a gradient-based method and analytical sensitivities, the framework presented is capable of solving a complete MEA optimization problem with state-of-the-art electrode models in approximately 30 min, making it a viable alternative for solving large-scale fuel cell problems. 相似文献
65.
Small package delivery companies offer services where packages are guaranteed to be delivered within a given time-frame. With variability in travel time, the configuration on the hub-and-spoke delivery network is vital in ensuring a high probability of meeting the service-level guarantee. We present the stochastic p-hub center problem with chance constraints, which we use to model the service-level guarantees. We discuss analytical results, propose solution heuristics, and present the results from computational experiments. 相似文献
66.
Matching with don't-cares and a small number of mismatches 总被引:1,自引:0,他引:1
In matching with don't-cares and k mismatches we are given a pattern of length m and a text of length n, both of which may contain don't-cares (a symbol that matches all symbols), and the goal is to find all locations in the text that match the pattern with at most k mismatches, where k is a parameter. We present new algorithms that solve this problem using a combination of convolutions and a dynamic programming procedure. We give randomized and deterministic solutions that run in time O(nk2logm) and O(nk3logm), respectively, and are faster than the most efficient extant methods for small values of k. Our deterministic algorithm is the first to obtain an O(polylog(k)⋅nlogm) running time. 相似文献
67.
String inclusion and non-inclusion problems have been vigorously studied in such diverse fields as molecular biology, data compression, and computer security. Among the well-known string inclusion or non-inclusion notions, we are interested in the longest common nonsuperstring. Given a set of strings, the longest common nonsuperstring problem is finding the longest string that is not a superstring of any string in the given set. It is known that the longest common nonsuperstring problem is solvable in polynomial time.In this paper, we propose an efficient algorithm for the longest common nonsuperstring problem. The running time of our algorithm is linear with respect to the sum of the lengths of the strings in the given set, using generalized suffix trees. 相似文献
68.
Adam Amit Kimmel Ron Rivlin Ehud 《IEEE transactions on pattern analysis and machine intelligence》2009,31(9):1708-1714
We consider curve evolution based on comparing distributions of features, and its applications for scene segmentation. In the first part, we promote using cross-bin metrics such as the Earth Mover's Distance (EMD), instead of standard bin-wise metrics as the Bhattacharyya or Kullback-Leibler metrics. To derive flow equations for minimizing functionals involving the EMD, we employ a tractable expression for calculating EMD between one-dimensional distributions. We then apply the derived flows to various examples of single image segmentation, and to scene analysis using video data. In the latter, we consider the problem of segmenting a scene to spatial regions in which different activities occur. We use a nonparametric local representation of the regions by considering multiple one-dimensional histograms of normalized spatiotemporal derivatives. We then obtain semisupervised segmentation of regions using the flows derived in the first part of the paper. Our results are demonstrated on challenging surveillance scenes, and compare favorably with state-of-the-art results using parametric representations by dynamic systems or mixtures of them. 相似文献
69.
We provide a technique to detect the singularities of rational planar curves and to compute the correct order of each singularity including the infinitely near singularities without resorting to blow ups. Our approach employs the given parametrization of the curve and uses a μ-basis for the parametrization to construct two planar algebraic curves whose intersection points correspond to the parameters of the singularities including infinitely near singularities with proper multiplicity. This approach extends Abhyankar's method of t-resultants from planar polynomial curves to rational planar curves. We also derive the classical result that for a rational planar curve of degree n the sum of all the singularities with proper multiplicity is (n−1)(n−2)/2. Examples are provided to flesh out our results. 相似文献
70.
Fault based testing aims at detecting hypothesized faults based on specifications or program source. There are some fault
based techniques for testing Boolean expressions which are commonly used to model conditions in specifications as well as
logical decisions in program source. The MUMCUT strategy has been proposed to generate test cases from Boolean expressions.
Moreover, it detects eight common types of hypothesized faults provided that the original expression is in irredundant disjunctive
normal form, IDNF. Software practitioners are more likely to write the conditions and logical decisions in general form rather
than IDNF. Hence, it is interesting to investigate the fault detecting capability of the MUMCUT strategy with respect to general
form Boolean expressions. In this article, we perform empirical studies to investigate the fault detection capability of the
MUMCUT strategy with respect to general form Boolean expressions as well as mutated expressions. A mutated expression can
be obtained from the original given Boolean expression by making a syntactic change based on a particular type of fault.
T. Y. Chen obtained his BSc and MPhil from the University of Hong Kong, MSc and DIC from the Imperial College of Science and Technology, PhD from the University of Melbourne. He is currently a Professor of Software Engineering at the Swinburne University of Technology. Prior to joining Swinburne, he has taught at the University of Hong Kong and the University of Melbourne. His research interests include software testing, debugging, maintenance, and validation of requirements. M. F. Lau received the Ph.D. degree in Software Engineering from the University of Melbourne, Australia. He is currently a Senior Lecturer in the Faculty of Information and Communication Technologies, Swinburne University of Technology, Australia. His research publications have appeared in various scholarly journals, including ACM Transactions on Software Engineering and Methodology, The Journal of Systems and Software, The Computer Journal, Software Testing, Verification and Reliability, Information and Software Technology, Information Sciences, and Information Processing Letters. His research interests include software testing, software quality, software specification and computers in education. K. Y. Sim received his Bachelor of Engineering in Electrical, Electronics and Systems from the National University of Malaysia in 1999 and the Master of Computer Science from the University of Malaya, Malaysia in 2001. Currently, he is a Senior Lecturer in the School of Engineering, Swinburne University of Technology, Sarawak Campus, Malaysia. His current research interests include software testing and information security. C. A. Sun received the PhD degree in Computer Software and Theory in 2002 from Beijing University of Aeronautics and Astronautics, China; the bachelor degree in Computer and Its application in 1997 from University of Science and Technology Beijing, China. He is currently an Assistant Professor in the School of Computer and Information Technology, Beijing Jiaotong University, China. His research areas are software testing, software architecture and service-oriented computing. He has published about 40 referred papers in the above areas. He is an IEEE member. 相似文献
M. F. LauEmail: |
T. Y. Chen obtained his BSc and MPhil from the University of Hong Kong, MSc and DIC from the Imperial College of Science and Technology, PhD from the University of Melbourne. He is currently a Professor of Software Engineering at the Swinburne University of Technology. Prior to joining Swinburne, he has taught at the University of Hong Kong and the University of Melbourne. His research interests include software testing, debugging, maintenance, and validation of requirements. M. F. Lau received the Ph.D. degree in Software Engineering from the University of Melbourne, Australia. He is currently a Senior Lecturer in the Faculty of Information and Communication Technologies, Swinburne University of Technology, Australia. His research publications have appeared in various scholarly journals, including ACM Transactions on Software Engineering and Methodology, The Journal of Systems and Software, The Computer Journal, Software Testing, Verification and Reliability, Information and Software Technology, Information Sciences, and Information Processing Letters. His research interests include software testing, software quality, software specification and computers in education. K. Y. Sim received his Bachelor of Engineering in Electrical, Electronics and Systems from the National University of Malaysia in 1999 and the Master of Computer Science from the University of Malaya, Malaysia in 2001. Currently, he is a Senior Lecturer in the School of Engineering, Swinburne University of Technology, Sarawak Campus, Malaysia. His current research interests include software testing and information security. C. A. Sun received the PhD degree in Computer Software and Theory in 2002 from Beijing University of Aeronautics and Astronautics, China; the bachelor degree in Computer and Its application in 1997 from University of Science and Technology Beijing, China. He is currently an Assistant Professor in the School of Computer and Information Technology, Beijing Jiaotong University, China. His research areas are software testing, software architecture and service-oriented computing. He has published about 40 referred papers in the above areas. He is an IEEE member. 相似文献