首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   459篇
  免费   16篇
  国内免费   13篇
电工技术   8篇
综合类   13篇
化学工业   16篇
金属工艺   3篇
机械仪表   31篇
建筑科学   3篇
能源动力   5篇
轻工业   9篇
石油天然气   3篇
无线电   262篇
一般工业技术   65篇
冶金工业   4篇
原子能技术   10篇
自动化技术   56篇
  2023年   3篇
  2022年   1篇
  2021年   5篇
  2020年   7篇
  2019年   3篇
  2018年   6篇
  2017年   4篇
  2016年   4篇
  2015年   5篇
  2014年   16篇
  2013年   15篇
  2012年   16篇
  2011年   23篇
  2010年   9篇
  2009年   30篇
  2008年   24篇
  2007年   33篇
  2006年   42篇
  2005年   29篇
  2004年   34篇
  2003年   22篇
  2002年   30篇
  2001年   21篇
  2000年   18篇
  1999年   19篇
  1998年   20篇
  1997年   15篇
  1996年   6篇
  1995年   7篇
  1994年   5篇
  1993年   6篇
  1992年   4篇
  1991年   3篇
  1990年   2篇
  1987年   1篇
排序方式: 共有488条查询结果,搜索用时 16 毫秒
1.
用射线法导出了两段式激光器的输出谱公式,分析了外腔式半导体激光器的输出光谱,计算了ECLD被调二极管模式的不同波长处振时的阈值,获得了ECLD模式的波长表达式,讨论了二极管靠近光栅的一面的反射率的波长特性对输出的影响。  相似文献   
2.
In this paper, we study the dynamic survivable routing problem, both in optical networks without wavelength conversion and in optical networks with sparse wavelength conversion, and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously report cycles (that are formed by two disjoint-link routes) into the routing tables, our new hybrid algorithm can promptly determine the first population of cycles for a new request based on the routing table of its source node, without the time consuming process associated with current GA-based lightpath protection schemes. We further improve the performance of our algorithm by introducing a more advanced fitness function that is suitable for both the above networks. Extensive simulation studies on the ns-2 network simulator show that our hybrid algorithm achieves a significantly lower blocking probability than the conventional survivable routing algorithms for all the cases we studied.  相似文献   
3.
考虑用激光器与调制器直接耦合以及耦合槽的影响,用散射矩阵法及二步等效反射率法,对沟槽耦合腔激光器的波长调谐和频率调制特性的分析表明,数学处理简单,物理图像清晰。  相似文献   
4.
本文将激光射器与调制器的直接耦合和耦合槽的影响综合考虑,用散射矩阵法及两步等效反射率法,对沟槽耦合腔激光器的波长调谐和频率调制特性进行了分析,数学处理简单,物理图象清晰。  相似文献   
5.
赵霞 《光电工程》1996,23(5):29-33
介绍了一种利用线阵CCD实现宽波段、大视场脉冲激光波长及方向远场测量的原理和实验装置;对强烈背景下激光信号的提取与处理方法进行了理论分析和实验研究,给出了系统信噪比与探测器件工作频率的理论公式;最后简要介绍了远场实验和测试结果  相似文献   
6.
Measurements of the growth rate of roughness on a cathode surface can be used to study the physics of cathodic processes. But these growth rates are cell wide variables and they ordinarily depend on what is taking place at the anode as well as at the cathode. Our aim is to derive a simple condition under which the anode makes no contribution to the interpretation of growth rate measurements at the cathode.Our condition stems from the contribution of ion diffusion to the growth rate and it is satisfied for all non-small values of the wave number of a growing disturbance. This, together with the fact that surface tension is the only stabilizing factor and the fact that the surface tension coefficient multiplying the wave number is small, means that the anode ought not to be important for the fastest growing wave numbers.Once the effect of the anode is eliminated, the growth rate at the cathode can be expressed in a formula so simple that pencil and paper calculations are possible and this makes important questions in cell design easy to answer, e.g., is the growth rate diffusion controlled?  相似文献   
7.
Recently, progress has been made in the Generalized Multi-Protocol Label Switching (GMPLS) and Automatic Switched Optical Networks (ASON) standardizations. These technologies realize construction of large-scaled optical networks, interconnections among single-domain Wavelength Division Multiplexing (WDM) networks, and direct communication over multi-domain WDM networks. Meanwhile, it is known that the topology of the Internet exhibits the power-law attribute. Since the topology of the Internet, which is constructed by interconnecting ASs, exhibits the power-law, there is a possibility that large-scale WDM networks, which are constructed by interconnecting WDM networks, will also exhibit the power-law attribute. One of the structural properties of a topology that adheres to the power-law is that most nodes have just a few links, although some have a tremendous number of them. Another property is that the average distance between nodes is smaller than in a mesh-like network. A natural question is how such a structural property performs in WDM networks. In this paper, we first investigate the property of the power-law attribute of physical topologies for WDM networks. We compare the performance of WDM networks with mesh-like and power-law topologies, and show that links connected to high-degree nodes are bottlenecks in power-law topologies. To relax this, we introduce a concept of virtual fiber, which consists of two or more fibers, and propose its configuration method to utilize wavelength resources more effectively. We compare performances of power-law networks with and without our method by computer simulations. The results show that our method reduces the blocking probabilities by more than one order of magnitude.  相似文献   
8.
为满足光通信系统对于目标数据的快速捕获需求,缩小各级通信设备间的动态跟踪误差,设计基于嵌入式技术的空间光通信系统的前馈补偿系统;以并串转换电路作为唯一的电能输出装置,在光通信信号发射模块、波分复用器件、嵌入式光放大器三个通信设备元件的共同调节作用下,确定PWM功率放大器的实时执行能力,达到对前馈型角编码器的调度与应用,实现空间光通信系统前馈补偿结构的搭建;配置Linux嵌入内核的移植协议,多次创建空间光环境下的通信数据根文件,以此为存储标准,计算补偿调制的基础传信率,实现对前馈脉冲波的调制与处理,完成嵌入式通信系统的前馈补偿原理研究;实验结果表明,应用前馈补偿系统后,在光通信参量等于5.0×1011 T、7.0×1011 T、9.0×1011 T的情况下,目标数据的捕获速率均超过7.0 T/mm,满足缩小通信设备间动态跟踪误差的实际应用需求。  相似文献   
9.
彭利民 《计算机工程》2009,35(18):108-110
针对当前低速组播业务请求与光网络高速波长传输容量的问题,基于光网络组播业务疏导模型,提出动态组播业务疏导算法,将新的组播业务请求疏导到已建立的光组播树上,达到提高网络资源的利用率、降低组播业务连接阻塞概率的目的。仿真结果表明,该算法可有效地改善网络性能。  相似文献   
10.
We consider the problem of scheduling communication on optical WDM (wavelength division multiplexing) networks using the light-trails technology. We seek to design scheduling algorithms such that the given transmission requests can be scheduled using a minimum number of wavelengths (optical channels). We provide algorithms and close lower bounds for two versions of the problem on an nn processor linear array/ring network. In the stationary   version, the pattern of transmissions (given) is assumed to not change over time. For this, a simple lower bound is cc, the congestion or the maximum total traffic required to pass through any link. We give an algorithm that schedules the transmissions using O(c+logn)O(c+logn) wavelengths. We also show a pattern for which Ω(c+logn/loglogn)Ω(c+logn/loglogn) wavelengths are needed. In the on-line   version, the transmissions arrive and depart dynamically, and must be scheduled without upsetting the previously scheduled transmissions. For this case we give an on-line algorithm which has competitive ratio Θ(logn)Θ(logn). We show that this is optimal in the sense that every on-line algorithm must have competitive ratio Ω(logn)Ω(logn). We also give an algorithm that appears to do well in simulations (for the classes of traffic we consider), but which has competitive ratio between Ω(log2n/loglogn)Ω(log2n/loglogn) and O(log2n)O(log2n). We present detailed simulations of both our algorithms.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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