Modeling the effect of deep traps on the capacitance–voltage characteristics of p-type Si-doped GaAs Schottky diodes grown on high index GaAs substrates

Numerical simulation, using SILVACO-TCAD, is carried out to explain experimentally observed effects of different types of deep levels on the capacitance–voltage characteristics of p-type Si-doped GaAs Schottky diodes grown on high index GaAs substrates. Two diodes were grown on (311)A and (211)A oriented GaAs substrates using Molecular Beam Epitaxy (MBE). Although, deep levels were observed in both structures, the measured capacitance–voltage characteristics show a negative differential capacitance (NDC) for the (311)A diodes, while the (211)A devices display a usual behaviour. The NDC is related to the nature and spatial distribution of the deep levels, which are characterized by the Deep Level Transient Spectroscopy (DLTS) technique. In the (311)A structure only majority deep levels (hole traps) were observed while both majority and minority deep levels were present in the (211)A diodes. The simulation, which calculates the capacitance–voltage characteristics in the absence and presence of different types of deep levels, agrees well with the experimentally observed behaviour.     

小型机载激光通信系统设计与验证

针对空空宽带高速通信的需求，设计了小型化机载激光通信系统。仿真分析了300 km、2.5 Gb/s无线激光链路性能，并通过运动仿真台模拟机动环境测试了系统的跟踪与通信性能，其中粗跟踪误差为533.2 μrad(1σ)，精跟踪误差为3.6 μrad(1σ)，测试数据传输240 s，通信误码率为2.82×10-9。仿真与实验验证了该系统用于远距离空空无线激光通信的可行性。     

Effect of additive length and chemistry on the morphology of blends of conjugated thiophenes and fullerene derivative acceptor molecules

Small molecule additives have been shown to increase the device efficiency of conjugated polymer (donor) and fullerene derivative (acceptor) based organic solar cells by modifying the morphology of the device active layer. In this paper we conduct a systematic study of how additives affect the donor‐acceptor morphology using molecular dynamics simulations of blends of thiophene‐based oligomers, mimicking poly(3‐dodecylthiophene) (P3DDT) or poly(2,2′:5′,2”‐3,3”‐didocyl‐terthiophene) (PTTT), and fullerene derivatives with additives of varying length and chemical functionalization, mimicking experimentally used additives like methyl ester additives, diiodooctane, and alkanedithiols. We find that functionalization of additives with end groups that are attracted to acceptor molecules are necessary to induce increased donor‐acceptor macrophase separation. In blends where acceptors intercalate between oligomer alkyl side chains, functionalized additives decrease acceptor intercalation. Functionalized additives with shorter alkyl segments increase acceptor macrophase separation more than additives with same chemical functionalization but longer alkyl segments. © 2015 Wiley Periodicals, Inc. J. Polym. Sci., Part B: Polym. Phys. 2015 , 53, 1046–1057     

Monte Carlo simulation of electric conductivity for pure and doping fullerene (C60)

In this paper, we have used Monte Carlo (MC) method to simulate and study the temperature and doping effects on the electric conductivity of fullerene (C60). The results show that the band gap has reduced by the doping and the charge carrier transport is facilitated from valence band to conduction band by the temperature where is touched a 300 K. In this case, the conductivity reached a value of $4\times {10}^{-7}\text{S}{\text{cm}}^{-1}$. The electric conductivity of C60 can increase by the triphenylmethane dye crystal violet (CV) alkali metal to reach $4\times {10}^{-3}\text{S}{\text{cm}}^{-1}$ at 303 K. Our results of MC simulation have a good agreement with those extracted from literature [10], [33].     

Periodic Néel skyrmion transport

In this work, we have used the MuMax3 software to simulate devices consisting of a ferromagnetic thin film placed over a heavy metal thin film. The devices are two interconnected partial-disks where a Néel domain wall is formed in the disks junction. In our simulations we investigate devices with disk radius $r=50$ nm and different distance d between the disks centers (from $d=12$ nm to $d=2R=100$ nm). By applying strong sinusoidal external magnetic fields, we find a mechanism able to create, annihilate and even manipulate a skyrmion in each side of the device. This mechanism is discussed in terms of interactions between skyrmion and domain wall. The Néel domain wall formed in the center of the device interacts with the Néel skyrmion, leading to a process of transporting a skyrmion from one disk to the other periodically. Our results have relevance for potential applications in spintronics such as logical devices.     

Assembling hydrodynamic cloaks to conceal complex objects from drag

Transformation hydrodynamics and the corresponding metamaterials have been proposed as a means to exclude the drag force acting on an object. Here, we report a strategy to deploy the hydrodynamic cloaks in a more practical manner by assembling different-shaped cloaking parts. Our strategy is to first model a square-shaped cloak and a carpet cloak and then combine them to conceal a more complex-shaped space in the three-dimensional hydrodynamic flow. With the derivation of transformation hydrodynamics, the coordinate transformations for each hydrodynamic cloaking are demonstrated with the calculated viscosity tensors. The pressure and velocity fields of the square, triangular (carpet), and exemplary three-dimensional house-shaped cloaks are numerically simulated, thus showing a cloaking effect and reduced drag. This study suggests an efficient way of cloaking complex architectures from fluid-dynamic forces.     

基于mobile agent的分布式网络自管理模型

为了解决大规模、异构网络环境下基于“管理员密集”的传统网络管理模式带来的低效率和高出错率问题，提出了一种网络自管理模型，从网络管理的自动初始化和动态自管理两个方面实现对网络自动、自主、自适应的管理；提出了管理定位服务这一关键技术，在多个管理站协同工作的分布式网络环境中为设备自动定位出合适的管理站及初始的管理任务；采用可伸缩的分布式体系结构，适应了大规模网络的规模可变性等特点；基于mobile agent的管理框架进一步提高了管理的自适应性和灵活性。     

扬声器系统时域结构系数的仿真

从扬声器系统的等效类比线路出发,得出了阻抗特性Z(jω)的表达形式及其曲线。采用全面最小二乘法识别扬声器系统的时域函数的全套系数,从而测出扬声器系统的低频特性参数。以计算机仿真技术为基础,通过MATLAB和EWB软件进行系统模拟分析仿真,得到扬声器系统的阶跃响应、阻抗曲线等特性。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.