A comparison of algainas and InGaAsP-based 1.3 μm semiconductor lasers using high pressure

Abstract

We have compared the effect of hydrostatic pressure on the threshold current, I_th, and lasing energy, E_lase, of 1.3 pm quantum-well devices based upon AlGaInAs and InGaAsP. Whilst we observe a very similar dependence of E_lase on pressure for the two materials, we measure strikingly different variations of I_th. By applying pressure to 1.3 μm InGaAsP lasers, I_th typically decreases by ～ 10% over 1 GPa consistent with the reduction of Auger recombination, which forms ～ 50% of I_th at room temperature. However, for the 1.3 μm AlGaInAs-based lasers, we observe an increase in I_th by ～ 8% over the same pressure range. From these results we conclude that non-radiative recombination accounts for only ～ 20% of I_th in AlGaInAs-based devices. This is in good agreement with previous temperature dependence measurements and shows why AlGaInAs-based devices exhibit a reduced temperature sensitivity of I_th which is very important for telecommunications applications.     

An ordering (enumerative) algorithm for nonlinear 0-1 programming

In this paper, a new algorithm to solve a general 0–1 programming problem with linear objective function is developed. Computational experiences are carried out on problems where the constraints are inequalities on polynomials. The solution of the original problem is equivalent with the solution of a sequence of set packing problems with special constraint sets. The solution of these set packing problems is equivalent with the ordering of the binary vectors according to their objective function value. An algorithm is developed to generate this order in a dynamic way. The main tool of the algorithm is a tree which represents the desired order of the generated binary vectors. The method can be applied to the multi-knapsack type nonlinear 0–1 programming problem. Large problems of this type up to 500 variables have been solved.     

基于流函数模型的矢量海流生成方法

提出了一种基于海洋流函数模型的双站高频地波雷达径向流生成矢量流算法.该算法避免了传统矢量合成法将径向流进行插值带来的误差,而且符合海洋动力学原理,生成的流场更接近实际分布.通过计算机仿真发现,流函数算法的容错、容差能力比矢量合成法更强.在径向流探测标准误差为10 cm.s-1时,新算法反演结果的均方根误差减小了约5 cm.s-1.应用到雷达实测数据中,与海流计实测结果比较表明,新算法比传统算法的平均误差减小了2 cm.s-1.     

用硅双结型色敏器件测量色温

提出了一种用硅双结型色敏器件测量色温的方法．在合理的测控电路下，硅双结型色敏器件的电流对数比与实验灯泡的色温值呈良好的单值对应，经单片机处理后可以得到分段线性关系．通过对电流对数比与波长随线的数据拟合，结果表明，用硅双结型色敏器件测量色温，其测量温度可以到10^4K以上，精度可以达到10K．本文的方法与传统方法相比减少了工作量，降低了费用，具有通用性和实用价值．     

基于虚拟中心电流法的HL-2M快控电源数学模型

针对中国环流器2号M(HL-2M)装置中用于核聚变物理实验等离子体的垂直不稳定性控制的快控电源拓扑结构,充分考虑线圈的自感与互感对输出的影响,构建出数学模型,首次提出并运用虚拟中心电流法,使得控制算法更加简单,采用多输入多输出的控制方法,利用2个参量控制3个变量。本文基于基本供电方案得到多线圈耦合电压,基于快控电源拓扑推导出快控电源电路方程,再将其合并得到最终的线圈电压数学模型,最后进行仿真验证。结果表明数学模型搭建正确,为今后进行进一步计算提供了坚实的基础。     

多路Marx并联高压脉冲电源研究

脉冲功率技术在工业和生物医学领域有着广泛的应用,很多应用场合要求输出数百安培的高压脉冲。固态Marx发生器虽已研究多年,但是被广泛采用直插封装的IGBT和MOSFET功率半导体开关管的额定电流通常都低于100 A,无法满足低阻抗负载的应用需求。为提高输出脉冲电流幅值,提出两种多路Marx发生器并联的脉冲电源的拓扑结构,第一种方案采用多路Marx发生器直接并联,第二种是共用一组充电开关管的多路Marx发生器并联。由FPGA提供充放电控制信号,采用串芯磁环隔离驱动方案实现带负压偏置的同步驱动,主电路选用开通速度快、通流能力强的IGBT为主开关的半桥式固态方波Marx电路。实验结果表明,6路16级Marx直接并联的脉冲发生器能输出重频100 Hz高压方波脉冲幅值可达10 kV,在30 Ω负载侧输出峰值电流可达300 A,上升时间230 ns。共用充电开关管的6路4级Marx并联发生器在5 Ω电阻负载上的输出电流峰值可达300 A,最大输出电流可达460 A,上升时间272 ns。表明多路Marx发生器并联可以有效地减小系统内阻,提高系统带载能力;改进后的并联方案实现大电流脉冲输出的同时,所采用的开关管数量减小近一半,提高了系统的抗干扰能力的同时,降低了脉冲电源的成本;且增加级间并联导线可进一步改善均流效果。

     

一种脉冲强电流条件下导线电阻测量方法

在超强激光辐照电容线圈靶产生强磁场实验中,在约50 ps时,线圈电流达到20 kA以上。通过该实验结果与磁场产生理论模型对比,可得出该导线电阻值比常温直流电阻高出3个量级。对导线材料电阻率与趋肤效应的分析结果表明,该电阻值在量级上是合理的。获得超快脉冲强电流条件下的导线电阻值,有助于更深入理解线圈靶产生强磁场过程。     

交错跃迁Hofstadter梯子的量子流相

为玻色Hofstadter梯子模型引入交错跃迁,来扩展模型支持的量子流相.基于精确对角化和密度矩阵重整化群计算发现,无相互作用时,系统中包含横流相、涡旋相和纵流相;横流相来自均匀跃迁时Hofstadter梯子模型的Meissner相,纵流相是交错跃迁时才可见的流相.强相互作用极限下系统的超流区也包含横流相、纵流相和涡旋相,但存在更多的相变级数;超流区的横流相、纵流相之间存在相变但Mott区的不存在,把Mott区的"横、纵流相"称为Mott-均匀相,在Mott区只存在均匀相和涡旋相.跃迁的交错会压缩涡旋相存在的区域,使Mott区最终只剩下均匀相;跃迁的交错不仅能驱动Mott-超流相变,还使磁通的改变也能够驱动系统的Mott-超流相变.对这一系统的研究丰富了磁通系统中的量子流相,同时为研究拓扑流特性提供了模型支持.     

On the greedy solution in integer linear programming

A version of the greedy method not using any knapsack relaxation of the integer programming problem is considered in this paper. It is based on a natural partial ordering of the vectors. Our aim is to determine a large class of problems where the greedy solution is always optimal. The results generalize some theorems of an early paper of Magazine, Nemhauser and Trotter and at the same time show a connection between two different notions of combinatorics: the greedy method and the Hilbert basis.

---

Zusammenfassung In dieser Arbeit wird eine Version des Greedy-Algorithmus zur Lösung ganzzahliger linearer Optimierungsprobleme benutzt, die kein Rucksackproblem als Relaxation verwendet. Das Verfahren basiert auf der natürlichen partiellen Ordnung von Vektoren. Ziel der Arbeit ist es, eine möglichst große Problemklasse zu beschreiben, für die die Greedy-Lösung optimal ist. Die Ergebnisse verallgemeinern Sätze einer früheren Arbeit von Magazine, Nemhauser und Trotter und zeigen gleichzeitig einen Bezug zwischen zwei verschiedenen Gebieten der Kombinatorik auf: des Greedy-Verfahrens und von Hubert-Basen.