全文获取类型
收费全文 | 4519篇 |
免费 | 140篇 |
国内免费 | 11篇 |
专业分类
电工技术 | 70篇 |
综合类 | 29篇 |
化学工业 | 1372篇 |
金属工艺 | 106篇 |
机械仪表 | 86篇 |
建筑科学 | 270篇 |
矿业工程 | 8篇 |
能源动力 | 75篇 |
轻工业 | 369篇 |
水利工程 | 25篇 |
石油天然气 | 3篇 |
无线电 | 264篇 |
一般工业技术 | 840篇 |
冶金工业 | 609篇 |
原子能技术 | 40篇 |
自动化技术 | 504篇 |
出版年
2022年 | 49篇 |
2021年 | 60篇 |
2020年 | 50篇 |
2019年 | 59篇 |
2018年 | 67篇 |
2017年 | 55篇 |
2016年 | 99篇 |
2015年 | 86篇 |
2014年 | 114篇 |
2013年 | 210篇 |
2012年 | 174篇 |
2011年 | 263篇 |
2010年 | 189篇 |
2009年 | 167篇 |
2008年 | 198篇 |
2007年 | 192篇 |
2006年 | 134篇 |
2005年 | 161篇 |
2004年 | 134篇 |
2003年 | 108篇 |
2002年 | 90篇 |
2001年 | 87篇 |
2000年 | 86篇 |
1999年 | 94篇 |
1998年 | 110篇 |
1997年 | 94篇 |
1996年 | 77篇 |
1995年 | 80篇 |
1994年 | 73篇 |
1993年 | 75篇 |
1992年 | 70篇 |
1991年 | 50篇 |
1990年 | 77篇 |
1989年 | 48篇 |
1988年 | 45篇 |
1987年 | 53篇 |
1986年 | 44篇 |
1985年 | 63篇 |
1984年 | 56篇 |
1983年 | 48篇 |
1982年 | 51篇 |
1981年 | 46篇 |
1979年 | 46篇 |
1978年 | 44篇 |
1977年 | 66篇 |
1976年 | 45篇 |
1975年 | 42篇 |
1974年 | 59篇 |
1972年 | 41篇 |
1970年 | 41篇 |
排序方式: 共有4670条查询结果,搜索用时 11 毫秒
31.
32.
Klaus Kamm 《化学,工程师,技术》1988,60(11):920-921
33.
34.
Anshu Dubey Klaus Weide Dongwook Lee John Bachan Christopher Daley Samuel Olofin Noel Taylor Paul M. Rich Lynn B. Reid 《Software》2015,45(2):233-244
When developing a complex, multi‐authored code, daily testing on multiple platforms and under a variety of conditions is essential. It is therefore necessary to have a regression test suite that is easily administered and configured, as well as a way to easily view and interpret the test suite results. We describe the methodology for verification of FLASH, a highly capable multiphysics scientific application code with a wide user base. The methodology uses a combination of unit and regression tests and an in‐house testing software that is optimized for operation under limited resources. Although our practical implementations do not always comply with theoretical regression‐testing research, our methodology provides a comprehensive verification of a large scientific code under resource constraints.Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
35.
Linear inverse Gaussian problems are traditionally solved using least squares-based inversion. The center of the posterior Gaussian probability distribution is often chosen as the solution to such problems, while the solution is in fact the posterior Gaussian probability distribution itself. We present an algorithm, based on direct sequential simulation, which can be used to efficiently draw samples of the posterior probability distribution for linear inverse problems. There is no Gaussian restriction on the distribution in the model parameter space, as inherent in traditional least squares-based algorithms.As data for linear inverse problems can be seen as weighed linear averages over some volume, block kriging can be used to perform both estimation (i.e. finding the center of the posterior Gaussian pdf) and simulation (drawing samples of the posterior Gaussian pdf). We present the kriging system which we use to implement a flexible GSLIB-based algorithm for solving linear inverse problems.We show how we implement such a simulation program conditioned to linear average data. The program is called VISIM as an acronym for Volume average Integration SIMulation. An effort has been made to make the program efficient, even for larger scale problems, and the computational efficiency and accuracy of the code is investigated.Using a synthetic cross-borehole tomography case study, we show how the program can be used to generate realizations of the a posteriori distributions (i.e. solutions) from a linear tomography problem. Both Gaussian and non-Gaussian a priori model parameter distributions are considered. 相似文献
36.
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling
problems. We illustrate the technique on two different scheduling problems: scheduling on unrelated parallel machines with
costs and the job shop scheduling problem. The time complexity of the resulting approximation schemes is always linear in
the number n of jobs, and the multiplicative constant hidden in the O(n) running time is reasonably small and independent of the error ε.
Supported by Swiss National Science Foundation project 200020-109854, “Approximation Algorithms for Machine scheduling Through
Theory and Experiments II”.
A preliminary version of this paper appeared in the Proceedings of ESA’01. 相似文献
37.
Klaus Dräger Bernd Finkbeiner Andreas Podelski 《International Journal on Software Tools for Technology Transfer (STTT)》2009,11(1):27-37
In directed model checking, the traversal of the state space is guided by an estimate of the distance from the current state
to the nearest error state. This paper presents a distance-preserving abstraction for concurrent systems that allows one to compute an interesting estimate of the error distance without hitting the state
explosion problem. Our experiments show a dramatic reduction both in the number of states explored by the model checker and
in the total runtime. 相似文献
38.
Norbert Kuhn Klaus Madlener Friedrich Otto 《Applicable Algebra in Engineering, Communication and Computing》1994,5(5):287-316
Algorithms for solving uniform decision problems for algebraic structures crucially depend on the chosen finite presentations for the structures under consideration. Rewriting techniques have been used very successfully to solve uniform decision problems, when the presentations considered involve finite, noetherian, and ()-confluent rewriting systems. Whenever the class of algebraic structures considered is closed under the operation of taking finitely generated substructures, then the algorithms for solving the uniform decision problems can be applied to the substructures as well. However, since these algorithms depend on the form of the presentations, this involves the task of constructing a presentation of a certain form for a substructure given a presentation of this form for the structure itself and a finite set of generating elements for the substructure.This problem, which has received a lot of attention in algebra, is here investigated from an algorithmic point of view. The structures considered are the following two classes of groups, which have been studied extensively before: the polycyclic groups and the context-free groups.Finitely generated context-free groups can be presented by finite, monadic, and -confluent string-rewriting systems. Due to their nice algorithmic properties these systems provide a way to effectively solve many decision problems for context-free groups. Since finitely generated subgroups of context-free groups are again contextfree, they can be presented in the same way. Here we describe a process that, from a finite, monadic, and -confluent string-rewriting system presenting a context-free groupG and a finite subsetU ofG, determines a presentation of this form for the subgroup U ofG that is generated byU. For finitely presented polycyclic groups we obtain an analogous result, when we use finite confluent PCP2-presentations to describe these groups.This work was performed while this author was visiting at the Fachbereich Informatik, Universität Kaiserslautern, during his sabbatical 1991/92 相似文献
39.
Optimized Photoinitiator for Fast Two‐Photon Absorption Polymerization of Polyester‐Macromers for Tissue Engineering 下载免费PDF全文
40.
Transistors: Impact of Interfacial Microstructure on Charge Carrier Transport in Solution‐Processed Conjugated Polymer Field‐Effect Transistors (Adv. Mater. 11/2016) 下载免费PDF全文