全文获取类型
收费全文 | 1270篇 |
免费 | 33篇 |
专业分类
电工技术 | 101篇 |
综合类 | 5篇 |
化学工业 | 277篇 |
金属工艺 | 34篇 |
机械仪表 | 36篇 |
建筑科学 | 31篇 |
能源动力 | 84篇 |
轻工业 | 73篇 |
水利工程 | 3篇 |
无线电 | 108篇 |
一般工业技术 | 271篇 |
冶金工业 | 106篇 |
原子能技术 | 34篇 |
自动化技术 | 140篇 |
出版年
2023年 | 4篇 |
2022年 | 16篇 |
2021年 | 18篇 |
2020年 | 9篇 |
2019年 | 21篇 |
2018年 | 19篇 |
2017年 | 12篇 |
2016年 | 29篇 |
2015年 | 15篇 |
2014年 | 41篇 |
2013年 | 75篇 |
2012年 | 52篇 |
2011年 | 59篇 |
2010年 | 60篇 |
2009年 | 55篇 |
2008年 | 64篇 |
2007年 | 53篇 |
2006年 | 42篇 |
2005年 | 58篇 |
2004年 | 39篇 |
2003年 | 42篇 |
2002年 | 33篇 |
2001年 | 36篇 |
2000年 | 22篇 |
1999年 | 28篇 |
1998年 | 39篇 |
1997年 | 37篇 |
1996年 | 40篇 |
1995年 | 22篇 |
1994年 | 22篇 |
1993年 | 34篇 |
1992年 | 13篇 |
1991年 | 23篇 |
1990年 | 14篇 |
1989年 | 18篇 |
1988年 | 7篇 |
1987年 | 9篇 |
1986年 | 18篇 |
1985年 | 21篇 |
1984年 | 7篇 |
1983年 | 10篇 |
1982年 | 10篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1974年 | 4篇 |
1972年 | 2篇 |
排序方式: 共有1303条查询结果,搜索用时 15 毫秒
11.
12.
Masahiro Nakagawa Tadashi Kondo Tsuyosi Kudo Shoichiro Takao Junji Ueno 《Artificial Life and Robotics》2009,14(2):118-122
In this study, we propose a revised radial basis function (RBF) neural network algorithm and apply this algorithm to computer-aided diagnosis (CAD) of the liver. First, the revised RBF neural network algorithm is applied to recognition of the liver regions, and the recognition results are compared with those obtained using the conventional RBF neural network and the conventional multilayered neural network trained using the back-propagation algorithm. It is shown that the revised RBF neural network is accurate, and is a useful method because the parameters are automatically determined. Then, the revised RBF neural network is applied to CAD of the liver cancer called hepatocellular carcinoma (HCC). 相似文献
13.
A data-driven design method for a cascade control system is proposed. The cascade control system consists of inner and outer loops, where the control interval of the outer loop is an integer multiple of the inner loop; hence, the system is a dual-rate system. In the proposed method, controllers in the inner and outer loops are designed based on one-shot data. In such a dual-rate cascade system, since the controllers are designed using different data-rate signals, the lifting technique is applied to align the dual-rate data. To show its effectiveness, the proposed method is compared with a conventional single-rate cascade control method, and numerical simulations and experiments are presented to examine servo and regulation performance. 相似文献
14.
15.
Field‐Effect Transistors: Integration of Organic Electrochemical and Field‐Effect Transistors for Ultraflexible,High Temporal Resolution Electrophysiology Arrays (Adv. Mater. 44/2016) 下载免费PDF全文
16.
Shih-Ying LinShi-Jinn Horng Tzong-Wann KaoChin-Shyurng Fahn Pingzhi FanYuan-Hsin Chen Muhammad Khurram KhanAnu Bourgeois Takao Terano 《Image and vision computing》2011,29(4):272-285
Traditionally, the block-based medial axis transform (BB-MAT) and the chessboard distance transform (CDT) were usually viewed as two completely different image computation problems, especially for three dimensional (3D) space. In fact, there exist some equivalent properties between them. The relationship between both of them is first derived and proved in this paper. One of the significant properties is that CDT for 3D binary image V is equal to BB-MAT for image V' where it denotes the inverse image of V. In a parallel algorithm, a cost is defined as the product of the time complexity and the number of processors used. The main contribution of this work is to reduce the costs of 3D BB-MAT and 3D CDT problems proposed by Wang [65]. Based on the reverse-dominance technique which is redefined from dominance concept, we achieve the computation of the 3D CDT problem by implementing the 3D BB-MAT algorithm first. For a 3D binary image of size N3, our parallel algorithm can be run in O(logN) time using N3 processors on the concurrent read exclusive write (CREW) parallel random access machine (PRAM) model to solve both 3D BB-MAT and 3D CDT problems, respectively. The presented results for the cost are reduced in comparison with those of Wang's. To the best of our knowledge, this work is the lowest costs for the 3D BB-MAT and 3D CDT algorithms known. In parallel algorithms, the running time can be divided into computation time and communication time. The experimental results of the running, communication and computation times for the different problem sizes are implemented in an HP Superdome with SMP/CC-NUMA (symmetric multiprocessor/cache coherent non-uniform memory access) architecture. We conclude that the parallel computer (i.e., SMP/CC-NUMA architecture or cluster system) is more suitable for solving problems with a large amount of input size. 相似文献
17.
Makoto Sakamoto Kaoru Kajisa Naoko Tomozoe Takao Ito Hiroshi Furutani Michio Kono Satoshi Ikeda 《Artificial Life and Robotics》2008,13(1):61-64
In 1997, C.R. Dyer and A. Rosenfeld introduced an acceptor on a two-dimensional pattern (or tape), called the pyramid cellular acceptor, and demonstrated that many useful recognition tasks are executed by pyramid cellular acceptors in time proportional to the
logarithm of the diameter of the input. They also introduced a bottom-up pyramid cellular acceptor which is a restricted version of the pyramid cellular acceptor, and proposed some interesting open problems of the bottom-up
pyramid cellular acceptors. On the other hand, we think that the study of threedimensional automata has been meaningful as
the computational model of three-dimensional information processing such as computer vision, robotics, and so forth. In this
paper, we investigate about bottom-up pyramid cellular acceptors with three-dimensional layers, and show their some accepting
powers.
This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January
31–February 2, 2008 相似文献
18.
Satoru Maegawa Takao Mizusaki Yutaka Hirayoshi Tadashi Kusumoto Akira Hirai 《Journal of Low Temperature Physics》1980,39(1-2):151-171
Nuclear spin-lattice relaxation properties of hcp solid 3He with 4He impurities have been studied. At temperatures below the exchange plateau region, three kinds of relaxation time were observed. To analyze the data, a phenomenological four-bath model was developed, the four baths being the Zeeman bath, the phonon bath, an X-bath, and a Y-bath. The X-bath consists of the exchange bath and a part of the 4He-4He elastic interaction bath. The Y-bath is the main part of the elastic interaction bath. We measured the concentration dependence of the energy constants of all the baths, as well as the temperature and concentration dependences of the three kinds of relaxation time. The relaxation behavior corresponding to the process between the X-bath and the Y-bath could not be expressed by a single exponential function of time and the relaxation rate was strongly dependent on the concentration. This process may be related to the internal thermal equilibrium process within the elastic interaction bath. The impurity-dependent relaxation time between the X-bath and the phonon bath had a temperature dependence of T
–n with n = 7.4±0.3. 相似文献
19.
20.
Many sorting algorithms have been studied in the past, but there are only a few algorithms that can effectively exploit both single‐instruction multiple‐data (SIMD) instructions and thread‐level parallelism. In this paper, we propose a new high‐performance sorting algorithm, called aligned‐access sort (AA‐sort), that exploits both the SIMD instructions and thread‐level parallelism available on today's multicore processors. Our algorithm consists of two phases, an in‐core sorting phase and an out‐of‐core merging phase. The in‐core sorting phase uses our new sorting algorithm that extends combsort to exploit SIMD instructions. The out‐of‐core algorithm is based on mergesort with our novel vectorized merging algorithm. Both phases can take advantage of SIMD instructions. The key to high performance is eliminating unaligned memory accesses that would reduce the effectiveness of SIMD instructions in both phases. We implemented and evaluated the AA‐sort on PowerPC 970MP and Cell Broadband Engine platforms. In summary, a sequential version of the AA‐sort using SIMD instructions outperformed IBM's optimized sequential sorting library by 1.8 times and bitonic mergesort using SIMD instructions by 3.3 times on PowerPC 970MP when sorting 32 million random 32‐bit integers. Also, a parallel version of AA‐sort demonstrated better scalability with increasing numbers of cores than a parallel version of bitonic mergesort on both platforms. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献