全文获取类型
收费全文 | 5863篇 |
免费 | 321篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 76篇 |
综合类 | 13篇 |
化学工业 | 1500篇 |
金属工艺 | 140篇 |
机械仪表 | 117篇 |
建筑科学 | 402篇 |
矿业工程 | 29篇 |
能源动力 | 146篇 |
轻工业 | 455篇 |
水利工程 | 50篇 |
石油天然气 | 8篇 |
无线电 | 453篇 |
一般工业技术 | 1245篇 |
冶金工业 | 257篇 |
原子能技术 | 37篇 |
自动化技术 | 1262篇 |
出版年
2024年 | 11篇 |
2023年 | 102篇 |
2022年 | 143篇 |
2021年 | 231篇 |
2020年 | 150篇 |
2019年 | 129篇 |
2018年 | 190篇 |
2017年 | 165篇 |
2016年 | 250篇 |
2015年 | 242篇 |
2014年 | 301篇 |
2013年 | 400篇 |
2012年 | 381篇 |
2011年 | 467篇 |
2010年 | 357篇 |
2009年 | 342篇 |
2008年 | 343篇 |
2007年 | 319篇 |
2006年 | 243篇 |
2005年 | 212篇 |
2004年 | 160篇 |
2003年 | 149篇 |
2002年 | 129篇 |
2001年 | 82篇 |
2000年 | 79篇 |
1999年 | 69篇 |
1998年 | 78篇 |
1997年 | 46篇 |
1996年 | 50篇 |
1995年 | 57篇 |
1994年 | 36篇 |
1993年 | 33篇 |
1992年 | 29篇 |
1991年 | 22篇 |
1990年 | 18篇 |
1989年 | 19篇 |
1988年 | 15篇 |
1987年 | 13篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1984年 | 23篇 |
1983年 | 9篇 |
1982年 | 9篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1976年 | 9篇 |
1975年 | 6篇 |
1974年 | 5篇 |
排序方式: 共有6190条查询结果,搜索用时 15 毫秒
31.
B. Fishbain Dorit S. Hochbaum Stefan Mueller 《Journal of Real-Time Image Processing》2016,11(3):589-609
Rapid advances in image acquisition and storage technology underline the need for real-time algorithms that are capable of solving large-scale image processing and computer-vision problems. The minimum s–t cut problem, which is a classical combinatorial optimization problem, is a prominent building block in many vision and imaging algorithms such as video segmentation, co-segmentation, stereo vision, multi-view reconstruction, and surface fitting to name a few. That is why finding a real-time algorithm which optimally solves this problem is of great importance. In this paper, we introduce to computer vision the Hochbaum’s pseudoflow (HPF) algorithm, which optimally solves the minimum s–t cut problem. We compare the performance of HPF, in terms of execution times and memory utilization, with three leading published algorithms: (1) Goldberg’s and Tarjan’s Push-Relabel; (2) Boykov’s and Kolmogorov’s augmenting paths; and (3) Goldberg’s partial augment-relabel. While the common practice in computer-vision is to use either BK or PRF algorithms for solving the problem, our results demonstrate that, in general, HPF algorithm is more efficient and utilizes less memory than these three algorithms. This strongly suggests that HPF is a great option for many real-time computer-vision problems that require solving the minimum s–t cut problem. 相似文献
32.
33.
This paper studies a new class of single-machine scheduling problems, which are faced by Just-in-Time-suppliers satisfying a given demand. In these models the processing of jobs leads to a release of a predefined number of product units into inventory. Consumption is triggered by predetermined time-varying, and product-specific demand requests. While all demands have to be fulfilled, the objective is to minimize the resulting product inventory. We investigate different subproblems of this general setting with regard to their computational complexity. For more restricted problem versions strongly polynomial time algorithms are presented. In contrast to this, NP-hardness in the strong sense is proven for more general problem versions. Moreover, for the most general version, even finding a feasible solution is shown to be strongly NP-hard. 相似文献
34.
LUO Yu ZHAO RongKuo FERNANDEZ-DOMINGUEZ Antonio I. MAIER Stefan A. PENDRY John B. 《中国科学:信息科学(英文版)》2013,56(12):1-13
Transformation optics (TO) is a new tool for controlling electromagnetic fields. In the context of metamaterial technology, it provides a direct link between a desired electromagnetic (EM) phenomenon and the material response required for its occurrence. Recently, this powerful framework has been successfully exploited to study surface plasmon assisted phenomena such as light harvesting. Here, we review the general strategy based on TO to design plasmonic devices capable of harvesting light over a broadband spectrum and achieving considerable field confinement and enhancement. The methodology starts with two-dimensional (2D) cases, such as 2D metal edges, crescent-shaped cylinders, nanowire dimers, and rough metal surfaces, and is well extended to fully-fledged three-dimensional (3D) situations. The largely analytic approach gives physical insights into the processes involved and suggests a way forward to study a wide variety of plasmonic nanostructures. 相似文献
35.
Yazdan Shirvany Fredrik Edelvik Stefan Jakobsson Anders Hedström Mikael Persson 《Applied Soft Computing》2013,13(5):2515-2525
Surgical therapy has become an important therapeutic alternative for patients with medically intractable epilepsy. Correct and anatomically precise localization of an epileptic focus is essential to decide if resection of brain tissue is possible. The inverse problem in EEG-based source localization is to determine the location of the brain sources that are responsible for the measured potentials at the scalp electrodes. We propose a new global optimization method based on particle swarm optimization (PSO) to solve the epileptic spike EEG source localization inverse problem. In a forward problem a modified subtraction method is proposed to reduce the computational time. The good accuracy and fast convergence are demonstrated for 2D and 3D cases with realistic head models. The results from the new method are promising for use in the pre-surgical clinic in the future. 相似文献
36.
Nicolas Gisin Sandu Popescu Valerio Scarani Stefan Wolf Jürg Wullschleger 《Natural computing》2013,12(1):13-17
We show that from a communication-complexity perspective, the primitive called oblivious transfer—which was introduced in a cryptographic context—can be seen as the classical analogue to a quantum channel in the same sense as non-local boxes are of maximally entangled qubits. More explicitly, one realization of non-cryptographic oblivious transfer allows for the perfect simulation of sending one qubit and measuring it in an orthogonal basis. On the other hand, a qubit channel allows for realizing non-cryptographic oblivious transfer with probability roughly 85 %, whereas 75 % is the classical limit. 相似文献
37.
38.
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph
equals the smallest number of edges of an interval supergraph. Since computing the profile of a graph is an NP-hard problem,
we consider parameterized versions of the problem. Namely, we study the problem of deciding whether the profile of a connected
graph of order n is at most n−1+k, considering k as the parameter; this is a parameterization above guaranteed value, since n−1 is a tight lower bound for the profile. We present two fixed-parameter algorithms for this problem. The first algorithm
is based on a forbidden subgraph characterization of interval graphs. The second algorithm is based on two simple kernelization
rules which allow us to produce a kernel with linear number of vertices and edges. For showing the correctness of the second
algorithm we need to establish structural properties of graphs with small profile which are of independent interest.
A preliminary version of the paper is published in Proc. IWPEC 2006, LNCS vol. 4169, 60–71. 相似文献
39.
The high-conductance state of cortical networks 总被引:3,自引:0,他引:3
We studied the dynamics of large networks of spiking neurons with conductance-based (nonlinear) synapses and compared them to networks with current-based (linear) synapses. For systems with sparse and inhibition-dominated recurrent connectivity, weak external inputs induced asynchronous irregular firing at low rates. Membrane potentials fluctuated a few millivolts below threshold, and membrane conductances were increased by a factor 2 to 5 with respect to the resting state. This combination of parameters characterizes the ongoing spiking activity typically recorded in the cortex in vivo. Many aspects of the asynchronous irregular state in conductance-based networks could be sufficiently well characterized with a simple numerical mean field approach. In particular, it correctly predicted an intriguing property of conductance-based networks that does not appear to be shared by current-based models: they exhibit states of low-rate asynchronous irregular activity that persist for some period of time even in the absence of external inputs and without cortical pacemakers. Simulations of larger networks (up to 350,000 neurons) demonstrated that the survival time of self-sustained activity increases exponentially with network size. 相似文献
40.
Zeolite based trace humidity sensor for high temperature applications in hydrogen atmosphere 总被引:1,自引:0,他引:1
We present a humidity sensor based on H-ZSM-5 type zeolite that is suitable to detect traces of humidity (10–110 ppmV) under harsh conditions, e.g. reducing atmosphere (H2) and high temperature (up to 600 °C). By means of complex impedance spectroscopy (IS) we show that the zeolite sensor responds linearly towards minimal changes in humidity. Therefore this result indicates that the zeolite sensor is capable to detect traces of humidity in processes where high temperatures in a hydrogen environment are required. 相似文献