全文获取类型
收费全文 | 7978篇 |
免费 | 1227篇 |
国内免费 | 1082篇 |
专业分类
电工技术 | 236篇 |
综合类 | 758篇 |
化学工业 | 49篇 |
金属工艺 | 5篇 |
机械仪表 | 167篇 |
建筑科学 | 26篇 |
矿业工程 | 33篇 |
能源动力 | 45篇 |
轻工业 | 22篇 |
水利工程 | 160篇 |
石油天然气 | 14篇 |
武器工业 | 32篇 |
无线电 | 2702篇 |
一般工业技术 | 264篇 |
冶金工业 | 50篇 |
原子能技术 | 3篇 |
自动化技术 | 5721篇 |
出版年
2024年 | 30篇 |
2023年 | 91篇 |
2022年 | 128篇 |
2021年 | 147篇 |
2020年 | 210篇 |
2019年 | 152篇 |
2018年 | 174篇 |
2017年 | 257篇 |
2016年 | 296篇 |
2015年 | 418篇 |
2014年 | 537篇 |
2013年 | 618篇 |
2012年 | 671篇 |
2011年 | 734篇 |
2010年 | 619篇 |
2009年 | 684篇 |
2008年 | 730篇 |
2007年 | 731篇 |
2006年 | 601篇 |
2005年 | 524篇 |
2004年 | 421篇 |
2003年 | 342篇 |
2002年 | 254篇 |
2001年 | 230篇 |
2000年 | 144篇 |
1999年 | 100篇 |
1998年 | 87篇 |
1997年 | 56篇 |
1996年 | 56篇 |
1995年 | 42篇 |
1994年 | 31篇 |
1993年 | 30篇 |
1992年 | 23篇 |
1991年 | 22篇 |
1990年 | 9篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 9篇 |
1984年 | 17篇 |
1983年 | 14篇 |
1982年 | 9篇 |
1980年 | 3篇 |
1964年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
求解最小MPR集的蚁群算法与仿真 总被引:1,自引:0,他引:1
在分析利用贪心策略启发式算法求解最小MPR集的缺陷基础上,引入蚁群算法对最小MPR集进行求解.首先定义了节点及其出度和入度,并根据节点的出度和入度限制,给出了求解最小MPR集的蚁群算法.然后,对蚁群算法的3种模型Ant-Cycle、Ant-Quantity和Ant-Density加以改进,并对这3种改进模型的收敛性进行分析与实验.实验采用了圆形分布和理想均匀分布2种拓扑结构,前者实验结果表明Ant-Cycle模型的收敛速度较快,后者结果表明Ant-Cycle模型和Ant-Density模型各有优势.因此,最小MPR集的蚁群算法的模型选择需依据拓扑结构确定.最后,使用OPNET基于该算法对数据链的点对多点的点名呼叫工作方式进行模拟仿真,选择的统计量显示了节点的连通性和数据一致性,验证了该算法的合理性. 相似文献
102.
103.
104.
郑辉 《数字社区&智能家居》2011,(6)
随着计算机网络技术普及和发展,计算机网络已经基本普及到各行各业,我们越来越多人在刻苦钻也计算机网络技术,我就计算机网络技术中有类路由汇总进行探讨和研究,通过有类路由与无类别域间路由的区别以及有类路由在网络设备技术中路由发布情况的研究和探讨得出总结性结论。 相似文献
105.
106.
?pek Abas?kele? 《Computers & Electrical Engineering》2010,36(1):114-131
Recent advances in the development of optical technologies suggest the possible emergence of broadcast-based optical interconnects within cache-coherent distributed shared memory (DSM) multiprocessor architectures. It is well known that the cache-coherence protocol is a critical issue in designing such architectures because it directly affects memory latencies. In this paper, we evaluate via simulation the performance of three directory-based cache-coherence protocols; strict request-response, intervention forwarding and reply forwarding on the Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus), which is a low-latency and high-bandwidth broadcast-based fiber-optic interconnection network supporting DSM. The simulated system contains 64 nodes, each of which has a processor, a cache controller, a directory controller and an output channel. Simulations have been conducted for each protocol to measure average processor utilization, average network latency and average number of packets transferred over the network for varying values of the important DSM parameters such as the ratio of the mean channel service time to mean thread run time (T/R), probability of a cache block being in modified state {P(M)}, the fraction of write misses {P(W)} and home node contention rate. The results reveal that for all cases, except for low values of P(M), intervention forwarding gives the worst performance (lowest processor utilization and highest latency). The performance of strict request-response and reply forwarding is comparable for several values of the DSM parameters and contention rate. For a contention rate of 0%, the increase of P(M) makes reply forwarding perform better than strict request-response. The performance of all protocols decreases with the increase of P(W) and contention rate. However, the performance of strict request-response is the least affected among other protocols due to the negative impact of the increase of P(W) and contention rate. Therefore, for the full contention case (i.e. contention rate of 100%); for low values of P(M), or for mid values of P(M) and high values of P(W), strict request-response performs better than reply forwarding. These results are significant in the sense that they provide an insight to multiprocessor architecture designers for comparing the performance of different directory-based cache-coherence protocols on a broadcast-based interconnection network for different values of the DSM parameters and varying rates of contention. 相似文献
107.
Mehdi Kargahi Author Vitae Ali Movaghar Author Vitae 《Computers & Electrical Engineering》2010,36(5):835-849
This paper introduces an analytical method for approximating the performance of a firm real-time system consisting of a number of parallel infinite-capacity single-server queues. The service discipline for the individual queues is earliest-deadline-first (EDF). Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. Jobs either all have deadlines until the beginning of service or deadlines until the end of service. Upon arrival, a job joins a queue according to a state-dependent stationary policy, where the state of the system is the number of jobs in each queue. Migration among the queues is not allowed. An important performance measure to consider is the overall loss probability of the system. The system is approximated by a Markovian model in the long run. The resulting model can then be solved analytically using standard Markovian solution techniques. Comparing numerical and simulation results for at least three different stationary policies, we find that the existing errors are relatively small. 相似文献
108.
Ching-Wen Chen Author Vitae Chuan-Chi Weng Author Vitae 《Journal of Systems and Software》2010,83(8):1373-1386
The transmission bandwidth between two nodes in mobile ad hoc networks is important in terms of power consumption. However, the bandwidth between two nodes is always treated the same, regardless of what the distance is between the two nodes. If a node equips a GPS device to determine the distance between two nodes, the hardware cost and the power consumption increase. In this paper, we propose using a bandwidth-based power-aware routing protocol with signal detection instead of using GPS devices to determine the distance. In our proposed routing protocol, we use the received signal variation to predict the transmission bandwidth and the lifetime of a link. Accordingly, the possible amount of data that can be transmitted and the remaining power of nodes in the path after data transmission can be predicted. By predicting the possible amount of data that can be transmitted and the remaining power of nodes after data transmission, we can design a bandwidth-based power-aware routing protocol that has power efficiency and that prolongs network lifetime. In our simulation, we compare our proposed routing protocol with two signal-based routing protocols, SSA and ABR, and a power-aware routing protocol, MMBCR, in terms of the throughput, the average transmission bandwidth, the number of rerouting paths, the path lifetime, the power consumed when a byte is transmitted, and the network lifetime (the ratio of active nodes). 相似文献
109.
延迟容忍网络泛指没有稳定端到端传输路径的无线网络,广泛应用于太空网络、乡村网络、移动传感网络、Ad hoc网络等等,具有重要的研究意义.其路由问题极具挑战性,是当前的一个研究热点.本文针对基于区域单元(Cell)移动模型的延迟容忍网络,提出一个基于区域访问概率的路由算法--PROAREA算法.已有的算法主要通过节点间的相遇概率来指导路由决策,而PROAREA算法则通过各节点访问区域单元的概率估算出了节点间数据传输的期望延迟,从而能够直接使用期望延迟来指导路由决策,具有更好的效果.实验结果表明,与延迟容忍网络中的Epidemic算法和PROHET算法相比,PROAREA算法的传输成功率平均提高了15%和6.95%,而平均传输延迟平均降低了46.7%和40.2%. 相似文献
110.
针对目前Chord协议中逻辑覆盖网与底层物理拓扑不匹配的问题,提出了一种改进算法PRST-Chord(proximity routing selection and topology-based Chord).该算法基于底层的拓扑信息来构造节点标识,使得物理上相邻的节点在逻辑上也尽可能相邻,同时修改了Chord的查询算法,通过预测节点问的网络延时优化下一跳节点的路由选择.仿真实验结果表明,改进算法有效地降低了查询延时,提高了资源定位的性能. 相似文献