全文获取类型
收费全文 | 4522篇 |
免费 | 140篇 |
国内免费 | 10篇 |
专业分类
电工技术 | 68篇 |
综合类 | 29篇 |
化学工业 | 1353篇 |
金属工艺 | 105篇 |
机械仪表 | 84篇 |
建筑科学 | 274篇 |
矿业工程 | 8篇 |
能源动力 | 75篇 |
轻工业 | 350篇 |
水利工程 | 25篇 |
石油天然气 | 4篇 |
无线电 | 283篇 |
一般工业技术 | 821篇 |
冶金工业 | 608篇 |
原子能技术 | 38篇 |
自动化技术 | 547篇 |
出版年
2022年 | 48篇 |
2021年 | 58篇 |
2020年 | 47篇 |
2019年 | 57篇 |
2018年 | 67篇 |
2017年 | 55篇 |
2016年 | 95篇 |
2015年 | 88篇 |
2014年 | 119篇 |
2013年 | 210篇 |
2012年 | 174篇 |
2011年 | 255篇 |
2010年 | 192篇 |
2009年 | 170篇 |
2008年 | 202篇 |
2007年 | 195篇 |
2006年 | 135篇 |
2005年 | 160篇 |
2004年 | 132篇 |
2003年 | 103篇 |
2002年 | 89篇 |
2001年 | 85篇 |
2000年 | 88篇 |
1999年 | 92篇 |
1998年 | 126篇 |
1997年 | 88篇 |
1996年 | 83篇 |
1995年 | 78篇 |
1994年 | 70篇 |
1993年 | 79篇 |
1992年 | 72篇 |
1991年 | 49篇 |
1990年 | 74篇 |
1989年 | 47篇 |
1988年 | 46篇 |
1987年 | 56篇 |
1986年 | 43篇 |
1985年 | 61篇 |
1984年 | 56篇 |
1983年 | 49篇 |
1982年 | 57篇 |
1981年 | 44篇 |
1979年 | 44篇 |
1978年 | 45篇 |
1977年 | 66篇 |
1976年 | 45篇 |
1975年 | 45篇 |
1974年 | 56篇 |
1972年 | 41篇 |
1970年 | 40篇 |
排序方式: 共有4672条查询结果,搜索用时 0 毫秒
31.
Klaus Trangbaek 《Asian journal of control》2014,16(1):40-49
This paper deals with system identification for control of linear parameter varying systems. In practical applications, it is often important to be able to identify small plant changes in an incremental manner without shutting down the system and/or disconnecting the controller; unfortunately, closed‐loop system identification is more difficult than open‐loop identification. In this paper we prove that the so‐called Hansen scheme, a technique known from linear time‐invariant systems theory for transforming closed‐loop system identification problems into open‐loop‐like problems, can be extended to accommodate linear parameter varying systems as well. We investigate the identified subsystem's parameter dependency and observe that, under mild assumptions, the identified subsystem is affine in the parameter vector. Various identification methods are compared in direct and Hansen Scheme setups in simulation studies, and the application of the Hansen Scheme is seen to improve the identification performance. 相似文献
32.
33.
Klaus Kamm 《化学,工程师,技术》1988,60(11):920-921
34.
35.
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. 相似文献
36.
Daniele Panozzo Olga Diamanti Sylvain Paris Marco Tarini Evgeni Sorkine Olga Sorkine‐Hornung 《Computer Graphics Forum》2015,34(5):65-75
In the digital world, assigning arbitrary colors to an object is a simple operation thanks to texture mapping. However, in the real world, the same basic function of applying colors onto an object is far from trivial. One can specify colors during the fabrication process using a color 3D printer, but this does not apply to already existing objects. Paint and decals can be used during post‐fabrication, but they are challenging to apply on complex shapes. In this paper, we develop a method to enable texture mapping of physical objects, that is, we allow one to map an arbitrary color image onto a three‐dimensional object. Our approach builds upon hydrographics, a technique to transfer pigments printed on a sheet of polymer onto curved surfaces. We first describe a setup that makes the traditional water transfer printing process more accurate and consistent across prints. We then simulate the transfer process using a specialized parameterization to estimate the mapping between the planar color map and the object surface. We demonstrate that our approach enables the application of detailed color maps onto complex shapes such as 3D models of faces and anatomical casts. 相似文献
37.
Henning Zimmer Fabrice Rousselle Wenzel Jakob Oliver Wang David Adler Wojciech Jarosz Olga Sorkine‐Hornung Alexander Sorkine‐Hornung 《Computer Graphics Forum》2015,34(4):131-142
Renderings of animation sequences with physics‐based Monte Carlo light transport simulations are exceedingly costly to generate frame‐by‐frame, yet much of this computation is highly redundant due to the strong coherence in space, time and among samples. A promising approach pursued in prior work entails subsampling the sequence in space, time, and number of samples, followed by image‐based spatio‐temporal upsampling and denoising. These methods can provide significant performance gains, though major issues remain: firstly, in a multiple scattering simulation, the final pixel color is the composite of many different light transport phenomena, and this conflicting information causes artifacts in image‐based methods. Secondly, motion vectors are needed to establish correspondence between the pixels in different frames, but it is unclear how to obtain them for most kinds of light paths (e.g. an object seen through a curved glass panel). To reduce these ambiguities, we propose a general decomposition framework, where the final pixel color is separated into components corresponding to disjoint subsets of the space of light paths. Each component is accompanied by motion vectors and other auxiliary features such as reflectance and surface normals. The motion vectors of specular paths are computed using a temporal extension of manifold exploration and the remaining components use a specialized variant of optical flow. Our experiments show that this decomposition leads to significant improvements in three image‐based applications: denoising, spatial upsampling, and temporal interpolation. 相似文献
38.
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. 相似文献
39.
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. 相似文献
40.
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. 相似文献