全文获取类型
收费全文 | 10699篇 |
免费 | 1683篇 |
国内免费 | 674篇 |
专业分类
电工技术 | 813篇 |
综合类 | 991篇 |
化学工业 | 292篇 |
金属工艺 | 333篇 |
机械仪表 | 751篇 |
建筑科学 | 92篇 |
矿业工程 | 50篇 |
能源动力 | 252篇 |
轻工业 | 343篇 |
水利工程 | 28篇 |
石油天然气 | 332篇 |
武器工业 | 302篇 |
无线电 | 5143篇 |
一般工业技术 | 920篇 |
冶金工业 | 35篇 |
原子能技术 | 128篇 |
自动化技术 | 2251篇 |
出版年
2024年 | 46篇 |
2023年 | 182篇 |
2022年 | 280篇 |
2021年 | 305篇 |
2020年 | 384篇 |
2019年 | 320篇 |
2018年 | 325篇 |
2017年 | 426篇 |
2016年 | 493篇 |
2015年 | 560篇 |
2014年 | 743篇 |
2013年 | 707篇 |
2012年 | 918篇 |
2011年 | 957篇 |
2010年 | 695篇 |
2009年 | 654篇 |
2008年 | 710篇 |
2007年 | 742篇 |
2006年 | 644篇 |
2005年 | 513篇 |
2004年 | 406篇 |
2003年 | 333篇 |
2002年 | 264篇 |
2001年 | 232篇 |
2000年 | 211篇 |
1999年 | 154篇 |
1998年 | 158篇 |
1997年 | 125篇 |
1996年 | 123篇 |
1995年 | 101篇 |
1994年 | 84篇 |
1993年 | 64篇 |
1992年 | 54篇 |
1991年 | 36篇 |
1990年 | 34篇 |
1989年 | 21篇 |
1988年 | 12篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 5篇 |
1983年 | 10篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1973年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 250 毫秒
991.
992.
Björn Lisper 《Distributed Computing》1991,5(3):133-144
Summary Forming the transitive closure of a binary relation (or directed graph) is an important part of many algorithms. When the relation is represented by a bit matrix, the transitive closure can be efficiently computed in parallel in a systolic array.Here we propose two novel ways of computing the transitive closure of an arbitrarily big graph on a systolic array of fixed size. The first method is a simple partitioning of a well-known systolic algorithm for computing the transitive closure. The second is a block-structured algorithm. This algorithm is suitable for execution on a systolic array that can multiply fixed size bit matrices and compute transitive closure of graphs with a fixed number of nodes. The algorithm is, however, not limited to systolic array implementations; it works onany parallel architecture that can perform these bit matrix operatons efficiently.The shortest path problem, for directed graphs with weighted edges, can also be solved in the same manner, devised above, as the transitive closure is computed.
Björn Lisper was born in 1956 in Solna, Sweden. He received the M. Eng. Physics degree in 1980 and the Ph.D. degree in Computer Science in 1987, both from the Royal Institute of Technology in Stockholm. Currently he shares his time between the Royal Institute of Technology and the Swedish Institute of Computer Science. His research interests are mainly in the area of formal methods for deriving efficient parallel implementations of algorithms, including synthesis of fixed hardware structures for specific algorithms and compilation techniques for tightly coupled parallel systems. Dr. Lisper is a member of the European Association for Theoretical Computer Science. 相似文献
993.
994.
《IEEJ Transactions on Electrical and Electronic Engineering》2017,12(Z1):S164-S170
All sensory cortical areas, including the auditory cortex, are considered to be wired according to the same general laminar structure schema, commonly referred to as the canonical model of cortical circuitry. The auditory cortex in vivo , however, is functionally anisotropic; the functional organization along the tonotopic axis is qualitatively different from that orthogonal to this axis. In the current study, we examined whether the functional anisotropy of the auditory cortex observed in vivo is reflected in propagation activity driven by electric stimulation in the local microcircuitry in vitro . Using in vitro preparations of coronal and angled horizontal brain slices, we directly investigated their isotropic versus anisotropic properties using microstimulation and multi‐site recording with a multielectrode array substrate. Our results clearly demonstrated the isotropic properties of the circuits in slice preparations of the auditory cortex. Additionally, we found that driven by stimulation current in layer 4, the horizontal velocity of activity propagation in layer 2/3 was faster than the vertical velocity from layer 4 to layer 2/3 and the horizontal velocity in layer 4. On the basis of these results, we discuss the local network and its possible functions in the auditory cortex. © 2017 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc. 相似文献
995.
L. Karsch A. Bhm K. -Th. Brinkmann L. Demirrs M. Pfuff 《Nuclear instruments & methods in physics research. Section A, Accelerators, spectrometers, detectors and associated equipment》2001,460(2-3):362-367
A plastic scintillator array of 3.4 m2 total area for the detection of neutrons in medium-energy nucleon–nucleon reactions was constructed and built. Calibration procedures for the detector were developed which allow the monitoring of gain shifts by means of muons from the cosmic radiation. Experiments were performed in order to calibrate the efficiency simulations and study the performance of the detector using the d+t→+n reaction at 14.7 MeV neutron energy and proton-induced deuteron breakup at 300 MeV. 相似文献
996.
997.
998.
正交化超分辨算法在大信噪比时性能优良且运算量小,但由于正交化算法是一种信号子空间方法,因而在干扰相干时失效,而空间平滑方法已广泛应用于自适应阵列相干信号的分离.文中提出了3种基于空间平滑的改进正交化算法并给出了计算机仿真结果.第1种方法具有较小的运算量,但当信噪比降低时,性能会严重下降.第2种和第3种方法在运算量增加不多的情况下性能比第1种方法有所改善,尤其是当信噪比较小时.理论分析和计算机仿真结果表明这3种方法是有效的. 相似文献
999.
ESPRIT (estimation of signal parameters via rotational invariance techniques) is a recently introduced algorithm for narrowband
direction-of-arrival (DOA) estimation. Its principal advantage is that the DOA parameter estimates are obtained directly,
without knowledge (and hence storage) of the array manifold and without computation or search of some spectral measure. This
advantage is achieved by constraining the sensor array to be composed of two identical, translationally invariant subarrays.
In this paper, we analyse the sensitivity of ESPRIT to the assumption that the subarrays are identical. The analysis is applicable
to a wide variety of array errors, including non-identical angle-dependent and angle-independent gain and phase perturbations, errors in the locations of the subarray elements, and mutual coupling effects. A representative
simulation example will be presented to validate the analysis and compare the performance degradation of ESPRIT with that
of the MUSIC algorithm. 相似文献
1000.
In this paper, systolic techniques for the simulation of the Group Explicitmethod for parabolic equations by systolic array data structures using the Soft Systolic algorithm paradigm have been extended to include hyperbolic equations of first order. In particular, the Group Explicit Complete (GEC) strategy can be used as generic array construction for other simple schemes and for comput ations on large intervals. The easy form of the finite difference approximation to the hyperbolic equation res ults in a simpler and hence faster and more area efficient basic cell. 相似文献