全文获取类型
收费全文 | 921篇 |
免费 | 72篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 3篇 |
综合类 | 2篇 |
化学工业 | 327篇 |
金属工艺 | 38篇 |
机械仪表 | 22篇 |
建筑科学 | 24篇 |
矿业工程 | 2篇 |
能源动力 | 41篇 |
轻工业 | 56篇 |
水利工程 | 5篇 |
石油天然气 | 2篇 |
无线电 | 70篇 |
一般工业技术 | 163篇 |
冶金工业 | 20篇 |
原子能技术 | 2篇 |
自动化技术 | 218篇 |
出版年
2023年 | 7篇 |
2022年 | 51篇 |
2021年 | 90篇 |
2020年 | 33篇 |
2019年 | 41篇 |
2018年 | 47篇 |
2017年 | 25篇 |
2016年 | 46篇 |
2015年 | 33篇 |
2014年 | 51篇 |
2013年 | 75篇 |
2012年 | 53篇 |
2011年 | 61篇 |
2010年 | 37篇 |
2009年 | 51篇 |
2008年 | 40篇 |
2007年 | 36篇 |
2006年 | 29篇 |
2005年 | 20篇 |
2004年 | 20篇 |
2003年 | 20篇 |
2002年 | 20篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 3篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 6篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1988年 | 4篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 5篇 |
1984年 | 7篇 |
1983年 | 6篇 |
1982年 | 3篇 |
1981年 | 6篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1977年 | 2篇 |
1968年 | 1篇 |
排序方式: 共有995条查询结果,搜索用时 15 毫秒
21.
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. 相似文献
22.
Paweł Jankowski Dominika Ogończyk Ladislav Derzsi Wojciech Lisowski Piotr Garstecki 《Microfluidics and nanofluidics》2013,14(3-4):597-604
Modification of the surfaces of polycarbonate (PC) with the use of a solution of tin (II) chloride renders them hydrophilic. The surface draping is stable against exposure to water and to alcohols. Exposure to alkanes reduces but does not diminish the effect. The method is compatible—in using the same solvent and temperature—with the hydrophobic modification of PC (Jankowski et al. in Lab Chip 11:1151–1156, 2011). The combination of these methods makes it possible to generate single and multiple monodisperse emulsions with the use of flow-focusing junctions in systems made in PC—a material that is suitable for fabrication of multilayer, high-throughput microfluidic devices. 相似文献
23.
Paweł Jankowski Dominika Ogończyk Ladislav Derzsi Wojciech Lisowski Piotr Garstecki 《Microfluidics and nanofluidics》2013,14(5):767-774
Modification of the surfaces of polycarbonate (PC) with the use of a solution of tin (II) chloride renders them hydrophilic. The surface draping is stable against exposure to water and to alcohols. Exposure to alkanes reduces but does not diminish the effect. The method is compatible—in using the same solvent and temperature—with the hydrophobic modification of PC Jankowski et al. ( Lab Chip 11:748–752, 2011). The combination of these methods makes it possible to generate single and multiple monodisperse emulsions with the use of flow-focusing junctions in systems made in PC—material that is suitable for fabrication of multilayer, high throughput microfluidic devices. 相似文献
24.
We observe that successive applications of known results from the theory of positive systems lead to an efficient general algorithm for positive realizations of transfer functions. We give two examples to illustrate the algorithm, one of which complements an earlier result of [L. Benvenuti, L. Farina, An example of how positivity may force realizations of ‘large’ dimensions, Systems Control Lett. 36 (1999) 261–266]. Finally, we improve a lower-bound of [B. Nagy, M. Matolcsi, A lower-bound on the dimension of positive realizations, IEEE Trans. Circuits Syst. I 50 (2003) 782–784] to indicate that the algorithm is indeed efficient in general. 相似文献
25.
Transistors: Impact of Interfacial Microstructure on Charge Carrier Transport in Solution‐Processed Conjugated Polymer Field‐Effect Transistors (Adv. Mater. 11/2016)
下载免费PDF全文
![点击此处可从《Advanced materials (Deerfield Beach, Fla.)》网站下载免费的PDF全文](/ch/ext_images/free.gif)
26.
Adrian Blumer Jan Novák Ralf Habel Derek Nowrouzezahrai Wojciech Jarosz 《Computer Graphics Forum》2016,35(7):461-473
Aggregate scattering operators (ASOs) describe the overall scattering behavior of an asset (i.e., an object or volume, or collection thereof) accounting for all orders of its internal scattering. We propose a practical way to precompute and compactly store ASOs and demonstrate their ability to accelerate path tracing. Our approach is modular avoiding costly and inflexible scene‐dependent precomputation. This is achieved by decoupling light transport within and outside of each asset, and precomputing on a per‐asset level. We store the internal transport in a reduced‐dimensional subspace tailored to the structure of the asset geometry, its scattering behavior, and typical illumination conditions, allowing the ASOs to maintain good accuracy with modest memory requirements. The precomputed ASO can be reused across all instances of the asset and across multiple scenes. We augment ASOs with functionality enabling multi‐bounce importance sampling, fast short‐circuiting of complex light paths, and compact caching, while retaining rapid progressive preview rendering. We demonstrate the benefits of our ASOs by efficiently path tracing scenes containing many instances of objects with complex inter‐reflections or multiple scattering. 相似文献
27.
For a word equation E of length n in one variable x occurring #
x
times in E a resolution algorithm of O(n+#
x
log n) time complexity is presented here. This is the best result known and for the equations that feature
#x < \fracnlogn\#_{x}<\frac{n}{\log n}
it yields time complexity of O(n) which is optimal. Additionally it is proven here that the set of solutions of any one-variable word equation is either of
the form F or of the form F∪(uv)+
u where F is a set of O(log n) words and u, v are some words such that uv is a primitive word. 相似文献
28.
Alternating-time temporal logic (atl) is a logic for reasoning about open computational systems and multi-agent systems. It is well known that atl model checking is linear in the size of the model. We point out, however, that the size of an atl model is usually exponential in the number of agents. When the size of models is defined in terms of states and agents rather than transitions, it turns out that the problem is (1) Δ
3
P
-complete for concurrent game structures, and (2) Δ
2
P
-complete for alternating transition systems. Moreover, for “Positive atl” that allows for negation only on the level of propositions, model checking is (1) Σ
2
P
-complete for concurrent game structures, and (2) NP-complete for alternating transition systems. We show a nondeterministic polynomial reduction from checking arbitrary alternating
transition systems to checking turn-based transition systems, We also discuss the determinism assumption in alternating transition
systems, and show that it can be easily removed.
In the second part of the paper, we study the model checking complexity for formulae of atl
with imperfect information (atl
ir
). We show that the problem is Δ
2
P
-complete in the number of transitions and the length of the formula (thereby closing a gap in previous work of Schobbens
in Electron. Notes Theor. Comput. Sci. 85(2), 2004). Then, we take a closer look and use the same fine structure complexity measure as we did for atl with perfect information. We get the surprising result that checking formulae of atl
ir
is also Δ
3
P
-complete in the general case, and Σ
2
P
-complete for “Positive atl
ir
”. Thus, model checking agents’ abilities for both perfect and imperfect information systems belongs to the same complexity
class when a finer-grained analysis is used. 相似文献
29.
The article concludes a series of results on cut-rule axiomatizabilityof the Lambek calculus. It is proved that the non-associativeproduct-free Lambek calculus with the empty string (NL0) isnot finitely axiomatizable if the only rule of inference admittedis Lambek's cut rule. The proof makes use of the (infinitely)cut-rule axiomatized calculus NC designed by the author exactlyfor that purpose. 相似文献
30.
Anna Korzynska Wojciech Strojny Andreas Hoppe David Wertheim Pawel Hoser 《Pattern Analysis & Applications》2007,10(4):301-319
This paper describes a segmentation method combining a texture based technique with a contour based method. The technique
is designed to enable the study of cell behaviour over time by segmenting brightfield microscope image sequences. The technique
was tested on artificial images, based on images of living cells and on real sequences acquired from microscope observations
of neutrophils and lymphocytes as well as on a sequence of MRI images. The results of the segmentation are compared with the
results of the watershed and snake segmentation methods. The results show that the method is both effective and practical.
相似文献
Anna KorzynskaEmail: |