全文获取类型
收费全文 | 2651篇 |
免费 | 277篇 |
国内免费 | 255篇 |
专业分类
电工技术 | 87篇 |
综合类 | 194篇 |
化学工业 | 49篇 |
金属工艺 | 63篇 |
机械仪表 | 118篇 |
建筑科学 | 57篇 |
矿业工程 | 29篇 |
能源动力 | 22篇 |
轻工业 | 8篇 |
水利工程 | 10篇 |
石油天然气 | 17篇 |
武器工业 | 15篇 |
无线电 | 355篇 |
一般工业技术 | 137篇 |
冶金工业 | 18篇 |
原子能技术 | 17篇 |
自动化技术 | 1987篇 |
出版年
2024年 | 7篇 |
2023年 | 35篇 |
2022年 | 35篇 |
2021年 | 60篇 |
2020年 | 69篇 |
2019年 | 63篇 |
2018年 | 78篇 |
2017年 | 89篇 |
2016年 | 91篇 |
2015年 | 132篇 |
2014年 | 159篇 |
2013年 | 177篇 |
2012年 | 210篇 |
2011年 | 233篇 |
2010年 | 163篇 |
2009年 | 191篇 |
2008年 | 215篇 |
2007年 | 199篇 |
2006年 | 196篇 |
2005年 | 138篇 |
2004年 | 91篇 |
2003年 | 91篇 |
2002年 | 74篇 |
2001年 | 54篇 |
2000年 | 38篇 |
1999年 | 22篇 |
1998年 | 28篇 |
1997年 | 33篇 |
1996年 | 22篇 |
1995年 | 30篇 |
1994年 | 23篇 |
1993年 | 17篇 |
1992年 | 10篇 |
1991年 | 13篇 |
1990年 | 8篇 |
1989年 | 9篇 |
1988年 | 3篇 |
1987年 | 7篇 |
1986年 | 6篇 |
1985年 | 4篇 |
1984年 | 11篇 |
1982年 | 9篇 |
1981年 | 6篇 |
1980年 | 6篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1975年 | 5篇 |
1974年 | 4篇 |
1973年 | 2篇 |
排序方式: 共有3183条查询结果,搜索用时 15 毫秒
1.
2.
3.
A new matching cost computation method based on nonsubsampled contourlet transform (NSCT) for stereo image matching is proposed in this paper. Firstly, stereo image is decomposed into high frequency sub-band images at different scales and along different directions by NSCT. Secondly, by utilizing coefficients in high frequency domain and grayscales in RGB color space, the computation model of weighted matching cost between two pixels is designed based on the gestalt laws. Lastly, two types of experiments are carried out with standard stereopairs in the Middlebury benchmark. One of the experiments is to confirm optimum values of NSCT scale and direction parameters, and the other is to compare proposed matching cost with nine known matching costs. Experimental results show that the optimum values of scale and direction parameters are respectively 2 and 3, and the matching accuracy of the proposed matching cost is twice higher than that of traditional NCC cost. 相似文献
4.
Design and Implementation of a Flexible Manufacturing Control System Using Neural Network 总被引:1,自引:0,他引:1
Magdy M. Abdelhameed Farid A. Tolbah 《International Journal of Flexible Manufacturing Systems》2002,14(3):263-279
Design and implementation of a sequential controller based on the concept of artificial neural networks for a flexible manufacturing system are presented. The recurrent neural network (RNN) type is used for such a purpose. Contrary to the programmable controller, an RNN-based sequential controller is based on a definite mathematical model rather than depending on experience and trial and error techniques. The proposed controller is also more flexible because it is not limited by the restrictions of the finite state automata theory. Adequate guidelines of how to construct an RNN-based sequential controller are presented. These guidelines are applied to different case studies. The proposed controller is tested by simulations and real-time experiments. These tests prove the successfulness of the proposed controller performances. Theoretical as well as experimental results are presented and discussed indicating that the proposed design procedure using Elman's RNN can be effective in designing a sequential controller for event-based type manufacturing systems. In addition, the simulation results assure the effectiveness of the proposed controller to outperform the effect of noisy inputs. 相似文献
5.
一种新的加权最小二乘测距定位方法 总被引:8,自引:0,他引:8
三站二维定位问题是最小定位问题,一般只利用几何关系就能获得定位估计,但由于未利用距离测量的统计信息,定位精度较差。该文先将点到点的距离测量转化为点到线的距离估计,再在此基础上推导出一种新的加权几休定位方法,其中加权的确定利用了距离测量的统计信息。仿真实验表明,在测距误差较小时新方法具有更高的定位精度。 相似文献
6.
In the paper, a model typical for contact situations of automotive brakes is established based on the method of movable cellular automata. The processes taking place at local contacts in an automotive brake system are analysed. Based on microscopic and micro-analytical observations, the following contact situations were simulated: (i) a couple of ferritic steel against pearlitic steel, both covered by an oxide layer mixed with graphite nanoparticles and (ii) the same situation but without oxide layers. The results of calculated mean coefficients of friction of the oxide-on-oxide contact correspond well to expected values for a real braking system, whereas steel-on-steel contact are twice as high. This allows one to make some conclusions; for example, oxide formation will take place more quickly than friction layer elimination, and finally this is responsible for the stabilisation of the coefficient of friction. 相似文献
7.
Dirk Abendroth Martin E. Eckel Ulrich Killat 《AEUE-International Journal of Electronics and Communications》2006,60(5):404-407
In this article, we present two efficient weighted fair queueing (WFQ) scheduling algorithms leaned on the well-known token bucket and leaky bucket shaping/policing algorithms. The performance of the presented algorithms is compared to those of the state-of-the-art WFQ approximations such as weighted round robin (WRR) and the recently proposed bin sort fair queueing (BSFQ). Our simulation results show that the proposed algorithms provide a better fairness at a lower implementation complexity while simultaneously achieving a comparable network utilization. 相似文献
8.
Learning Automata from Ordered Examples 总被引:1,自引:1,他引:0
Connectionist learning models have had considerable empirical success, but it is hard to characterize exactly what they learn. The learning of finite-state languages (FSL) from example strings is a domain which has been extensively studied and might provide an opportunity to help understand connectionist learning. A major problem is that traditional FSL learning assumes the storage of all examples and thus violates connectionist principles. This paper presents a provably correct algorithm for inferring any minimum-state deterministic finite-state automata (FSA) from a complete ordered sample using limited total storage and without storing example strings. The algorithm is an iterative strategy that uses at each stage a current encoding of the data considered so far, and one single sample string. One of the crucial advantages of our algorithm is that the total amount of space used in the course of learning for encoding any finite prefix of the sample is polynomial in the size of the inferred minimum state deterministic FSA. The algorithm is also relatively efficient in time and has been implemented. More importantly, there is a connectionist version of the algorithm that preserves these properties. The connectionist version requires much more structure than the usual models and has been implemented using the Rochester Connectionist Simulator. We also show that no machine with finite working storage can iteratively identify the FSL from arbitrary presentations. 相似文献
9.
10.
We report an unexpectedly rich variety of new flow patterns on a granular heap that is centrifuged so as to simulate a reduction
in gravity. These surface patterns exhibit coexisting static and flowing regions that depend strongly on centrifugal stress,
but surprisingly not on mass flow rate. A discrete cellular automata model reproduces some of the patterning features and
indicates that subsurface jamming may precipitate the formation of localized frozen patterns on the surface. This model provides
insights into the mechanics of granular flows under controlled stress environment and jammed-to-flowing transitions in granular
media. 相似文献