全文获取类型
收费全文 | 3970篇 |
免费 | 496篇 |
国内免费 | 348篇 |
专业分类
电工技术 | 465篇 |
综合类 | 460篇 |
化学工业 | 80篇 |
金属工艺 | 92篇 |
机械仪表 | 262篇 |
建筑科学 | 209篇 |
矿业工程 | 98篇 |
能源动力 | 22篇 |
轻工业 | 60篇 |
水利工程 | 20篇 |
石油天然气 | 64篇 |
武器工业 | 67篇 |
无线电 | 1238篇 |
一般工业技术 | 144篇 |
冶金工业 | 48篇 |
原子能技术 | 11篇 |
自动化技术 | 1474篇 |
出版年
2024年 | 9篇 |
2023年 | 56篇 |
2022年 | 109篇 |
2021年 | 104篇 |
2020年 | 138篇 |
2019年 | 103篇 |
2018年 | 77篇 |
2017年 | 109篇 |
2016年 | 116篇 |
2015年 | 161篇 |
2014年 | 248篇 |
2013年 | 214篇 |
2012年 | 306篇 |
2011年 | 324篇 |
2010年 | 234篇 |
2009年 | 283篇 |
2008年 | 293篇 |
2007年 | 319篇 |
2006年 | 234篇 |
2005年 | 255篇 |
2004年 | 198篇 |
2003年 | 188篇 |
2002年 | 170篇 |
2001年 | 117篇 |
2000年 | 117篇 |
1999年 | 73篇 |
1998年 | 47篇 |
1997年 | 42篇 |
1996年 | 26篇 |
1995年 | 30篇 |
1994年 | 21篇 |
1993年 | 16篇 |
1992年 | 15篇 |
1991年 | 10篇 |
1990年 | 11篇 |
1989年 | 7篇 |
1988年 | 12篇 |
1987年 | 7篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1984年 | 5篇 |
1983年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1977年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有4814条查询结果,搜索用时 15 毫秒
1.
针对空空宽带高速通信的需求,设计了小型化机载激光通信系统。仿真分析了300 km、2.5 Gb/s无线激光链路性能,并通过运动仿真台模拟机动环境测试了系统的跟踪与通信性能,其中粗跟踪误差为533.2 μrad(1σ),精跟踪误差为3.6 μrad(1σ),测试数据传输240 s,通信误码率为2.82×10-9。仿真与实验验证了该系统用于远距离空空无线激光通信的可行性。 相似文献
2.
3.
针对工业无线传感器网络对路由协议的QoS要求,研究了一种基于链路可靠性的两跳QoS路由(Link-Reliability Based Two-Hop Routing for QoS Guarantee in Industrial Wireless Sensor Networks, LRTHQR).采用两跳速度策略和数据优先级调度策略提高实时性,采用改进的信任评估模型以选择可信路径进行路由,采用基于接收功率的链接概率和数据包重传次数作为衡量链路可靠性的指标,同时采用能够综合考虑节点剩余能量和转发能耗的转发策略,以改善网络寿命.仿真结果显示:与未考虑链路可靠性的NCSRT (NodeCredible Security Routing for IWSN Based on THTR)算法相比, LRTHQR算法在丢包率、时延以及包平均能耗方面有着明显优势;与同样侧重QoS要求的LRTHR (Link-Reliability based Two-Hop Routing)算法相比, LRTHQR算法在截止期错失率、路由开销以及包平均能耗方面有着显著提升. 相似文献
4.
针对无线传感器网络拓扑快速变化、链路易拥塞断开,存在路由开销大、负载不均衡、网络生命周期短等问题,提出低开销负载均衡的改进型TORA(TORA-p)。通过定义网络变化率参数,自适应调整互联网封装协议(IMEP)中OBM包的最大重发次数,减少不必要的路由维护开销;同时,结合MAC层信息,定义链路可用性优化选路方式,自动平衡网络负载,避免关键路径和节点负载过重而过早死亡和断开。使用truetime2.0平台设定特定的仿真环境,对TORA-p算法的性能进行了详细比较分析,结果表明:TORA-p均衡了网络负载,提升了网络生命周期,同时也减少了路由开销和延时,展现出了较好的数据传输能力。 相似文献
5.
The existing analytical average bit error rate (ABER) expression of conventional generalised spatial modulation (CGSM) does not agree well with the Monte Carlo simulation results in the low signal‐to‐noise ratio (SNR) region. Hence, the first contribution of this paper is to derive a new and easy way to evaluate analytical ABER expression that improves the validation of the simulation results at low SNRs. Secondly, a novel system termed CGSM with enhanced spectral efficiency (CGSM‐ESE) is presented. This system is realised by applying a rotation angle to one of the two active transmit antennas. As a result, the overall spectral efficiency is increased by 1 bit/s/Hz when compared with the equivalent CGSM system. In order to validate the simulation results of CGSM‐ESE, the third contribution is to derive an analytical ABER expression. Finally, to improve the ABER performance of CGSM‐ESE, three link adaptation algorithms are developed. By assuming full knowledge of the channel at the receiver, the proposed algorithms select a subset of channel gain vector (CGV) pairs based on the Euclidean distance between all CGV pairs, CGV splitting, CGV amplitudes, or a combination of these. 相似文献
6.
Spam网页主要通过链接作弊手段达到提高搜索排名而获利的目的,根据链接作弊的特征,引入链接相似度和作弊系数两个指标来判定网页作弊的可能性。借鉴BadRank算法思想,从Spam网页种子集合通过迭代计算链接相似度和作弊系数,并根据与种子集合的链接指向关系设置权重,将待判定的网页进行度量。最后选取Anti-Trust Rank等算法作对比实验,结果验证了本文算法在准确率和适应性方面优于对比算法。 相似文献
7.
Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search. 相似文献
8.
9.
10.