全文获取类型
收费全文 | 19542篇 |
免费 | 2945篇 |
国内免费 | 2160篇 |
专业分类
电工技术 | 2996篇 |
技术理论 | 3篇 |
综合类 | 2076篇 |
化学工业 | 550篇 |
金属工艺 | 358篇 |
机械仪表 | 2170篇 |
建筑科学 | 495篇 |
矿业工程 | 335篇 |
能源动力 | 284篇 |
轻工业 | 583篇 |
水利工程 | 361篇 |
石油天然气 | 327篇 |
武器工业 | 220篇 |
无线电 | 2922篇 |
一般工业技术 | 1084篇 |
冶金工业 | 228篇 |
原子能技术 | 157篇 |
自动化技术 | 9498篇 |
出版年
2024年 | 103篇 |
2023年 | 251篇 |
2022年 | 463篇 |
2021年 | 586篇 |
2020年 | 578篇 |
2019年 | 513篇 |
2018年 | 489篇 |
2017年 | 688篇 |
2016年 | 802篇 |
2015年 | 972篇 |
2014年 | 1316篇 |
2013年 | 1281篇 |
2012年 | 1686篇 |
2011年 | 1659篇 |
2010年 | 1245篇 |
2009年 | 1277篇 |
2008年 | 1380篇 |
2007年 | 1568篇 |
2006年 | 1271篇 |
2005年 | 1221篇 |
2004年 | 1034篇 |
2003年 | 785篇 |
2002年 | 587篇 |
2001年 | 447篇 |
2000年 | 434篇 |
1999年 | 302篇 |
1998年 | 239篇 |
1997年 | 256篇 |
1996年 | 215篇 |
1995年 | 212篇 |
1994年 | 167篇 |
1993年 | 125篇 |
1992年 | 129篇 |
1991年 | 61篇 |
1990年 | 51篇 |
1989年 | 49篇 |
1988年 | 54篇 |
1987年 | 28篇 |
1986年 | 17篇 |
1985年 | 22篇 |
1984年 | 18篇 |
1983年 | 14篇 |
1982年 | 9篇 |
1981年 | 7篇 |
1980年 | 10篇 |
1979年 | 6篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 3篇 |
1973年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
In this paper, we study scheduling games under mixed coordination mechanisms on hierarchical machines. The two scheduling policies involved are ‐ and ‐, where ‐ (resp., ‐) policy sequences jobs in nondecreasing order of their hierarchies, and jobs of the same hierarchy in nonincreasing (resp., nondecreasing) order of their processing times. We first show the existence of a Nash equilibrium. Then we present the price of anarchy and the price of stability for the games with social costs of minimizing the makespan and maximizing the minimum machine load. All the bounds given in this paper are tight. 相似文献
3.
4.
串行和并行接口模式是A/D转换器诸多分类中的一种,但却是应用中器件选择的一个重要指标.在同样的转换分辨率及转换速度的前提下,不同的接口方式不但影响了电路结构,更重要的是将在高速数据采集的过程中对采样周期产生较大影响.本文通过12位串行ADC ADS7822和并行ADC ADS774与AT89C51的接口电路,给出二者采样时间的差异性. 相似文献
5.
可并联逆变器中的同步控制技术及其实现 总被引:5,自引:2,他引:3
论述了可并联逆变器中的同步控制技术及其实现方法。在分析了同步的重要性之后,提出了抢占与并发相结合的同步控制策略及其实现方法,实践证明该方法具有很高的控制精度。 相似文献
6.
Ying Tan 《The Journal of VLSI Signal Processing》2002,32(1-2):45-54
In this paper, we propose a new approach for signal detection in wireless digital communications based on the neural network with transient chaos and time-varying gain (NNTCTG), and give a concrete model of the signal detector after appropriate transformations and mappings. It is well known that the problem of the maximum likelihood signal detection can be described as a complex optimization problem that has so many local optima that conventional Hopfield-type neural networks fail to solve. By refraining from the serious local optima problem of Hopfield-type neural networks, the NNTCTG makes use of the time-varying parameters of the recurrent neural network to control the evolving behavior of the network so that the network undergoes the transition from chaotic behavior to gradient convergence. It has richer and more flexible dynamics rather than conventional neural networks only with point attractors, so that it can be expected to have much ability to search for globally optimal or near-optimal solutions. After going through a transiently inverse-bifurcation process, the NNTCTG can approach the global optimum or the neighborhood of global optimum of our problem. Simulation experiments have been performed to show the effectiveness and validation of the proposed neural network based method for the signal detection in digital communications. 相似文献
7.
This paper proposes a software pipelining framework, CALiBeR (ClusterAware Load Balancing Retiming Algorithm), suitable for compilers targetingclustered embedded VLIW processors. CALiBeR can be used by embedded systemdesigners to explore different code optimization alternatives, that is, high-qualitycustomized retiming solutions for desired throughput and program memory sizerequirements, while minimizing register pressure. An extensive set of experimentalresults is presented, demonstrating that our algorithm compares favorablywith one of the best state-of-the-art algorithms, achieving up to 50% improvementin performance and up to 47% improvement in register requirements. In orderto empirically assess the effectiveness of clustering for high ILP applications,additional experiments are presented contrasting the performance achievedby software pipelined kernels executing on clustered and on centralized machines. 相似文献
8.
Steven Y. Susswein Thomas C. Henderson Joseph L. Zachary Chuck Hansen Paul Hinker Gary C. Marsden 《International journal of parallel programming》1991,20(6):453-473
Filtering algorithms are well accepted as a means of speeding up the solution of the consistent labeling problem (CLP). Despite the fact that path consistency does a better job of filtering than arc consistency, AC is still the preferred technique because it has a much lower time complexity. We are implementing parallel path consistency algorithms on multiprocessors and comparing their performance to the best sequential and parallel arc consistency algorithms.(1,2) (See also work by Kerethoet al.
(3) and Kasif(4)) Preliminary work has shown linear performance increases for parallelized path consistency and also shown that in many cases performance is significantly better than the theoretical worst case. These two results lead us to believe that parallel path consistency may be a superior filtering technique. Finally, we have implemented path consistency as an outer product computation and have obtained good results (e.g., linear speedup on a 64K-node Connection Machine 2). 相似文献
9.
10.
根据某雷达系统对测量信号的快速传输要求,提出采用滑动帧的处理方法并在FPGA中实现,克服了传统帧处理难以满足快速传输要求的不足。阐述了滑动帧结构的构造思想,详述了滑动帧结构的特点及具体功能模块的实现。根据实际应用需求构造了滑动帧结构处理器,试验和应用结果表明设计可行有效,能充分满足实时数据传输的要求。 相似文献