全文获取类型
收费全文 | 1285篇 |
免费 | 147篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 20篇 |
综合类 | 3篇 |
化学工业 | 388篇 |
金属工艺 | 27篇 |
机械仪表 | 14篇 |
建筑科学 | 70篇 |
矿业工程 | 5篇 |
能源动力 | 38篇 |
轻工业 | 82篇 |
水利工程 | 14篇 |
石油天然气 | 2篇 |
无线电 | 118篇 |
一般工业技术 | 241篇 |
冶金工业 | 147篇 |
原子能技术 | 8篇 |
自动化技术 | 257篇 |
出版年
2024年 | 3篇 |
2023年 | 32篇 |
2022年 | 61篇 |
2021年 | 80篇 |
2020年 | 52篇 |
2019年 | 70篇 |
2018年 | 71篇 |
2017年 | 67篇 |
2016年 | 73篇 |
2015年 | 59篇 |
2014年 | 70篇 |
2013年 | 73篇 |
2012年 | 67篇 |
2011年 | 102篇 |
2010年 | 45篇 |
2009年 | 46篇 |
2008年 | 49篇 |
2007年 | 54篇 |
2006年 | 41篇 |
2005年 | 19篇 |
2004年 | 21篇 |
2003年 | 15篇 |
2002年 | 13篇 |
2001年 | 14篇 |
2000年 | 15篇 |
1999年 | 13篇 |
1998年 | 47篇 |
1997年 | 26篇 |
1996年 | 20篇 |
1995年 | 8篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 6篇 |
1985年 | 7篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1975年 | 4篇 |
1974年 | 3篇 |
1973年 | 6篇 |
1972年 | 3篇 |
1969年 | 3篇 |
1904年 | 2篇 |
排序方式: 共有1434条查询结果,搜索用时 15 毫秒
31.
Journal of Intelligent Manufacturing - Deep learning-based predictive quality enables manufacturing companies to make data-driven predictions of the quality of a produced product based on process... 相似文献
32.
Foehn Philipp Brescianini Dario Kaufmann Elia Cieslewski Titus Gehrig Mathias Muglikar Manasi Scaramuzza Davide 《Autonomous Robots》2022,46(1):307-320
Autonomous Robots - This paper presents a novel system for autonomous, vision-based drone racing combining learned data abstraction, nonlinear filtering, and time-optimal trajectory planning. The... 相似文献
33.
The Influence of Block Ionomer Microstructure on Polyplex Properties: Can Simulations Help to Understand Differences in Transfection Efficiency? 下载免费PDF全文
34.
Antonio Negretti Philipp Treutlein Tommaso Calarco 《Quantum Information Processing》2011,10(6):721-753
We review quantum information processing with cold neutral particles, that is, atoms or polar molecules. First, we analyze
the best suited degrees of freedom of these particles for storing quantum information, and then we discuss both single- and
two-qubit gate implementations. We focus our discussion mainly on collisional quantum gates, which are best suited for atom-chip-like
devices, as well as on gate proposals conceived for optical lattices. Additionally, we analyze schemes both for cold atoms
confined in optical cavities and hybrid approaches to entanglement generation, and we show how optimal control theory might
be a powerful tool to enhance the speed up of the gate operations as well as to achieve high fidelities required for fault
tolerant quantum computation. 相似文献
35.
Abhishek Arun Barry Haddow Philipp Koehn Adam Lopez Chris Dyer Phil Blunsom 《Machine Translation》2010,24(2):103-121
Recent advances in statistical machine translation have used approximate beam search for NP-complete inference within probabilistic
translation models. We present an alternative approach of sampling from the posterior distribution defined by a translation
model. We define a novel Gibbs sampler for sampling translations given a source sentence and show that it effectively explores
this posterior distribution. In doing so we overcome the limitations of heuristic beam search and obtain theoretically sound
solutions to inference problems such as finding the maximum probability translation and minimum risk training and decoding. 相似文献
36.
U. P. Hausmann Philipp Joerges J. Heinzl F. E. Talke 《Microsystem Technologies》2009,15(10-11):1747-1751
To increase the storage density of hard disk drives, the flying height of the slider needs to be reduced to <10 nm. This requires super-smooth surfaces of the disk and slider. As the roughness decreases, stiction and adhesion are found to increase substantially leading to failures of the head/disk interface. Texturing the slider surface is a well-known approach to this issue. In this study we investigated laser ablation as a potential process for texturing magnetic recording sliders. It was found that straight laser machining caused unwanted re-deposition of material. These deposits could be significantly reduced by using a chemical etching enhanced laser process. 相似文献
37.
Emanuel Gull Philipp Werner Sebastian Fuchs Brigitte Surer Thomas Pruschke Matthias Troyer 《Computer Physics Communications》2011,182(4):1078-1082
Continuous-time quantum Monte Carlo impurity solvers are algorithms that sample the partition function of an impurity model using diagrammatic Monte Carlo techniques. The present paper describes codes that implement the interaction expansion algorithm originally developed by Rubtsov, Savkin, and Lichtenstein, as well as the hybridization expansion method developed by Werner, Millis, Troyer, et al. These impurity solvers are part of the ALPS-DMFT application package and are accompanied by an implementation of dynamical mean-field self-consistency equations for (single orbital single site) dynamical mean-field problems with arbitrary densities of states.
Program summary
Program title: dmftCatalogue identifier: AEIL_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEIL_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: ALPS LIBRARY LICENSE version 1.1No. of lines in distributed program, including test data, etc.: 899 806No. of bytes in distributed program, including test data, etc.: 32 153 916Distribution format: tar.gzProgramming language: C++Operating system: The ALPS libraries have been tested on the following platforms and compilers:•
Linux with GNU Compiler Collection (g++ version 3.1 and higher), and Intel C++ Compiler (icc version 7.0 and higher) •
MacOS X with GNU Compiler (g++ Apple-version 3.1, 3.3 and 4.0) •
IBM AIX with Visual Age C++ (xlC version 6.0) and GNU (g++ version 3.1 and higher) compilers •
Compaq Tru64 UNIX with Compq C++ Compiler (cxx) •
SGI IRIX with MIPSpro C++ Compiler (CC) •
HP-UX with HP C++ Compiler (aCC) •
Windows with Cygwin or coLinux platforms and GNU Compiler Collection (g++ version 3.1 and higher)
[1]
A. Albuquerque, F. Alet, P. Corboz, et al., J. Magn. Magn. Mater. 310 (2007) 1187. [2]
http://arxiv.org/abs/1012.4474, Rev. Mod. Phys., in press.
38.
We investigate the use of two‐level nested grids as acceleration structure for ray tracing of dynamic scenes. We propose a massively parallel, sort‐based construction algorithm and show that the two‐level grid is one of the structures that is fastest to construct on modern graphics processors. The structure handles non‐uniform primitive distributions more robustly than the uniform grid and its traversal performance is comparable to those of other high quality acceleration structures used for dynamic scenes. We propose a cost model to determine the grid resolution and improve SIMD utilization during ray‐triangle intersection by employing a hybrid packetization strategy. The build times and ray traversal acceleration provide overall rendering performance superior to previous approaches for real time rendering of animated scenes on GPUs. 相似文献
39.
Long-lived renaming allows processes to repeatedly get distinct names from a small name space and release these names. This
paper presents two long-lived renaming algorithms in which the name a process gets is bounded above by the number of processes
currently occupying a name or performing one of these operations. The first algorithm is asynchronous, uses LL/SC objects, and has step complexity that is linear in the number of processes, c, currently getting or releasing a name. The second is synchronous, uses registers and counters, and has step complexity that
is polylogarithmic in c. Both tolerate any number of process crashes. 相似文献
40.
Martin Dietzfelbinger Jonathan E. Rowe Ingo Wegener Philipp Woelfel 《Algorithmica》2011,59(3):301-322
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We
present a (1+1)-EA with adaptive step size which finds the optimum in O(log n) steps, where n is the number of points used. We then consider binary (base-2) and reflected Gray code representations with single bit mutations.
The standard binary method does not guarantee locating the optimum, whereas using the reflected Gray code does so in Θ((log n)2) steps. A(1+1)-EA with a fixed mutation probability distribution is then presented which also runs in O((log n)2). Moreover, a recent result shows that this is optimal (up to some constant scaling factor), in that there exist unimodal
functions for which a lower bound of Ω((log n)2) holds regardless of the choice of mutation distribution. For continuous multimodal functions, the algorithm also locates
the global optimum in O((log n)2). Finally, we show that it is not possible for a black box algorithm to efficiently optimise unimodal functions for two or
more dimensions (in terms of the precision used). 相似文献