首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3409篇
  免费   324篇
  国内免费   23篇
化学   111篇
力学   10篇
综合类   32篇
数学   75篇
物理学   247篇
无线电   3281篇
  2024年   7篇
  2023年   23篇
  2022年   34篇
  2021年   45篇
  2020年   49篇
  2019年   41篇
  2018年   33篇
  2017年   101篇
  2016年   92篇
  2015年   148篇
  2014年   247篇
  2013年   230篇
  2012年   260篇
  2011年   258篇
  2010年   208篇
  2009年   199篇
  2008年   229篇
  2007年   247篇
  2006年   212篇
  2005年   202篇
  2004年   179篇
  2003年   177篇
  2002年   141篇
  2001年   115篇
  2000年   78篇
  1999年   47篇
  1998年   42篇
  1997年   22篇
  1996年   29篇
  1995年   20篇
  1994年   16篇
  1993年   7篇
  1992年   5篇
  1991年   4篇
  1990年   3篇
  1989年   2篇
  1988年   1篇
  1986年   1篇
  1983年   1篇
  1978年   1篇
排序方式: 共有3756条查询结果,搜索用时 46 毫秒
51.
阐述了图像通信的业务涵盖范围及其技术发展现状,简要介绍了图像通信的发展方向,指出了图像通信产业发展面临的研究课题。  相似文献   
52.
基于P89C669微控制器和计算机数据通信技术,设计了MODBUS协议转换器,实现了MODBUS网络的主控设备与RTU(远程终端单元)之间的数据转换,并在电力系统220 kV主变风冷控制中用于变电所站内自动化监控计算机系统的MODBUS网络和PLC(可编程逻辑控制器)的数据通信,使站内自动化监控系统可根据主变油温、负荷电流等运行参数对风冷机组和油泵进行实时调控。  相似文献   
53.
传统的协议栈没有对实现移动性的层次进行准确定位,所以几乎协议栈中的每一层都有实现移动性的方案,但对于移动互联网这种异质网络。分层的协议栈效率很低。根据协议栈和移动互联网移动性的特点,从协议栈的链路层、网络层、传输层和应用层上具体分析了各个层实现移动性的优缺点,通过这些分析可见,要给移动互联网中的移动节点提供良好的移动性支持,跨层实现动性是未来移动性发展的趋势。  相似文献   
54.
波长预留协议用于在光通道建立过程中预留和配置波长.目前已有的波长预留协议都把协议设计的目标定为降低网络阻塞率,没有一种协议设计把目标定为缩短光通道的建立时间和简化协议处理过程.然而更短的建立时间和更小的协议复杂度对于未来极其动态的光网络却是非常重要的.提出了一种新颖的用于波长路由光网络的分布式快速波长预留协议-目的端预留协议,它在保证网络阻塞率可以接受的前提下,不仅可以降低连接建立时间,还可以减少控制节点处理器需要处理的信令消息数量.仿真结果证明了这一点.  相似文献   
55.
Reusable [bmIm]OH was found to be a highly efficient renewable homogenous catalyst for the rapid and convenient synthesis of benzoxazine-4-one derivatives from o-iodobenzoic-acid and benzonitrile at 75 °C in moderate to good yields. This methodology provides a facile and straightforward path to construct other related heterocycles in an eco-compatible fashion.  相似文献   
56.
To ameliorate high collision, a nefarious side effect of route discovery stage of reactive routing protocols in wireless networks, jitter mechanisms are proposed which enforce wireless nodes to postpone their transmission for a random amount of time so as to reduce probability of simultaneous transmission. Although it has been shown that jitter mechanisms can dramatically improve reactive routing protocols, it was not until recently that jitter mechanisms have been subjected to study. In this paper, different random distributions are proposed for jittering mechanisms and also shaping function, with the aim of which a simple routing protocol like AODV becomes sensitive to any arbitrary metric, is defined. Comprehensive simulation of routing metrics and jitter mechanisms have revealed that simple modification of a jitter mechanism, which can be even implemented independent of a routing protocol, greatly improves routes discovered by any routing protocol.  相似文献   
57.
Cut-and-choose paradigm makes Yao's protocol for two-party computation secure in malicious model with an error probability.In CRYPTO 2013,based on multi-phase cut-and-choose,Lindell reduced this probability to the optimal value.However,this work can only compute single-output functions with optimal error probability.We transform multi-phase cut-and-choose for singleoutput case into one that can deal with two-output functions,meanwhile maintaining the optimal error probability.Based on this new paradigm,we propose an efficient two-output secure computation protocol.Besides,by utilizing the specific property of the output garbled keys,we solve the authenticity issue of the generator's output with only symmetric cryptographic operations linear in the output length of the generator,which is the most efficient method so far in standard model without Random oracle (Ro).  相似文献   
58.
This paper presents a novel analytical model of Transmission Control Protocol (TCP) using a generalized stochastic Petri net (GSPN). Extensive simulation work has been done for the performance evaluation of TCP NewReno protocol. In view of the limitations of the simulation technique, we present an analytical approach using GSPN. A GSPN is a useful mathematical tool that solves continuous time Markov chains for complex systems and evaluates the stationary behavior. In this paper, we analyze the slow‐but‐steady variant of TCP NewReno. The model captures the behavioral aspects of the slow start and the congestion avoidance phase together with the fast retransmit and recovery capabilities of TCP NewReno. Performance metrics such as throughput, goodput, and task completion time of the system are obtained. The effect of variation in the model parameters on the performance is studied. The results are validated using the network simulator, and their accuracy is verified by evaluating the confidence interval. The performance of the proposed model is compared with that of TCP Reno. The performance of the proposed model is also compared with one of the previous models. The numerical illustrations and comparison of the proposed technique with simulation validates the accuracy, efficiency, and competence of the GSPN technique. While GSPN modeling for TCP is investigated in depth for the TCP NewReno and TCP Reno variant in this paper, other protocols could be also analyzed similarly. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   
59.
The major purpose of this paper is to transmit an existing video above a complete simulated video streaming architecture based on Network Simulator (NS2). Thanks to our architecture, the visual quality evaluation of the distributed streaming platform under various conditions is simplified. Indeed, the received video can be easily visualized using a classic video client or be compared using the Peak Signal-Noise Ratio (PSNR) value and the Structural SIMilarity (SSIM) value. In the case study, we compare adaptive video congestion strategies using a transcoder, Datagram Congestion Control Protocol (DCCP) and TCP-Friendly Rate Control (TFRC).  相似文献   
60.
张智超 《电子科技》2015,28(3):83-86
针对不均等分簇协议中节点竞选半径和簇头的选取机制存在缺陷问题,提出了不均等分层分簇协议,将网络覆盖区域进行分层处理,降低了簇头簇内负担,提高了能量使用效率,并采用Matlab软件进行了仿真实验。仿真结果表明,UHC协议有效降低了簇内节点密度,且延长了网络使用寿命。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号