Electronic Structure of InN/GaN Quantum Dots: Multimillion-Atom Tight-Binding Simulations

The theoretical calculation of the electronic structure of any constituent materials is the first step toward the interpretation and understanding of experimental data and reliable device design. This is essentially true for nanoscale devices where both the atomistic granularity of the underlying materials and the quantum-mechanical nature of charge carriers play critical roles in determining the overall device performance. In this paper, within a fully atomistic and quantum-mechanical framework, we investigate the electronic structure of wurtzite InN quantum dots (QDs) self-assembled on GaN substrates. The main objectives are threefold: 1) to explore the nature and the role of crystal atomicity, strain field, and piezoelectric and pyroelectric potentials in determining the energy spectrum and the wave functions; 2) to address the redshift in the ground state, the symmetry lowering and the nondegeneracy in the first excited state, and the strong band mixing in the overall conduction-band electronic states, which is a group of interrelated phenomena that has been revealed in recent spectroscopic analyses; and 3) to study the size dependence of the internal fields and its impact on the electronic structure as a whole. We also demonstrate the importance of 3-D atomistic material representation and the need for using realistically extended substrate and cap layers (multimillion-atom modeling) in studying the built-in structural and electric fields in these reduced dimensional QDs. The models used in this study are as follows: 1) valence-force-field Keating model for atomistic strain relaxation; 2) 20-band nearest neighbor sp ³ d ⁵ s* tight-binding model for the calculation of single-particle energy states; and 3) microscopically determined polarization constants in conjunction with an atomistic 3-D Poisson solver for the calculation of piezo- and pyroelectric contributions.     

Preparation and Properties of PBXs Based on FOX-7 in Controlled Fragmentation Warhead Application（英）

Polymer bonded explosive(PBX)formulations were successfully prepared in the laboratory scale containing 1,1-diamino-2,2-dinitroethene(FOX-7)and hexogen(RDX)as brisant high explosives and different binder types of polyurethane(PU)based on glycidyl azide polymer(GAP) and hydroxyl-terminated polybutadiene(HTPB) as an energetic and inert polymeric binder respectively.Casting technique was used for the preparation of different PBX formulations based on FOX-7/RDX and PU(GAP/HTPB)with 14% binder.The sensitivity to different initial impulses and performance characteristics of the explosive and lethal zone of the tested controlled fragmentation warhead by the fragmentation warhead assessment test(arena test)were studied,in which the arena test was carried out with a controlled fragmentation warhead made from Ck45 steel,with dimensions(100 mm length,30 mm outer diameter and 3 mm thickness).Results show that PBXGF4 has lower sensitivity to impact and heat than those of PBXGR4 by 188.4% and 3.2% respectively.Its friction sensitivity is the same as that of PBXGR4.It has better performance,in which detonation velocity increases by 2.1% and brisance increases by 0.5% when compared with those of PBXGR4.It was concluded that PBXGF4 which based on FOX-7 bonded with PU/GAP matrix has good characteristics as PBX,specially in the sensitivity to impact and can be applied for replacing PBXs based on RDX in the advanced PBXs for low sensitive fragmentation warheads.     

基于DOE和遗传算法的传动系参数优化方法研究

研究了以经济性为目标的动力传动优化方法,利用试验设计和遗传优化算法,针对特定的驾驶循环,在不降低驾驶性能的前提下,寻求最佳的经济性匹配参数.计算结果表明,采用DOE与GA分析相结合的方法,不仅可以大幅缩减试验样本容量和仿真时间,亦可达到令人满意的效果.通过优化匹配,该矿用车的燃油消耗量下降了6.19%.     

Source localization using TDOA and FDOA measurements based on modified cuckoo search algorithm

This paper introduces a new algorithm for solving the localization problem of moving multiple disjoint sources using time difference of arrival and frequency difference of arrival. The localization of moving sources can be considered as a least-square problem. There are many algorithms used to solve this problem such as, two-step weighted least squares, constrained total least-square and practical constrained least-square. However, most of these algorithms suffer from either slow convergence or numerical instability and don’t attain Cramer–Rao lower bound. We introduce a free-gradient algorithm called cuckoo search which avoids the slow convergence problem. The cuckoo search provides a combined global and local search method. Simulation results show that the proposed algorithm achieves better performance than other algorithms and attains Cramer–Rao lower bound.     

Comparison of Performance of Packet Scheduling Algorithms in LTE-A HetNets

The concept of usage of heterogeneous networks (HetNets) is about improving the LTE system performance by increasing the capacity and coverage of the Macro cell. In this paper, a performance comparison of various packet scheduling algorithms such as Proportional Fair, Maximum Largest Weighted Delay First and Exponential/Proportional Fair is studied in detail in the HetNets environment. The key performance indicators such as throughput, packet loss ratio, delay and fairness are considered to judge the performance of the scheduling algorithms. Various strategies such as increasing the number of Pico cells in the cell edge were used in the simulation for the performance evaluation study. The results achieved through various simulations show that adding Pico cells to the existing Macros enhances the overall system performance in addition to the various scheduling algorithms implemented in Macros. For reader’s convenience, various types of graphs have been used to represent the simulation results to better understand the performance metrics of various scheduling algorithms. Simulation results shows that overall system gain has increased because of adding Picos and thereby providing better coverage in the cell edge areas and thereby increasing the capacity of the network to provide better quality of service.     

Recursive least squares identification methods for multivariate pseudo-linear systems using the data filtering

This paper concerns the parameter identification methods of multivariate pseudo-linear autoregressive systems. A multivariate recursive generalized least squares algorithm is presented as a comparison. By using the data filtering technique, a multivariate pseudo-linear autoregressive system is transformed into a filtered system model and a filtered noise model, and a filtering based multivariate recursive generalized least squares algorithm is developed for estimating the parameters of these two models. The proposed algorithm achieves a higher computational efficiency than the multivariate recursive generalized least squares algorithm, and the simulation results prove that the proposed method is effective.     

REBTAM: reliable energy balance traffic aware data reporting algorithm for object tracking in multi-sink wireless sensor networks

Recently, Multi-sink Wireless Sensor Networks (WSNs) have received more and more attention due to their significant advantages over the single sink WSNs such as improving network throughput, balancing energy consumption, and prolonging network lifetime. Object tracking is regarded as one of the key applications of WSNs due to its wide real-life applications such as wildlife animal monitoring and military area intrusion detection. However, many object tracking researches usually focus on how to track the location of objects accurately, while few researches focus on data reporting. In this work, we propose an efficient data reporting method for object tracking in multi-sink WSNs. Due to the limited energy resource of sensor nodes, it seems especially important to design an energy efficient data reporting algorithm for object tracking in WSNs. Moreover, the reliable data transmission is an essential aspect that should be considered when designing a WSN for object tracking application, where the loss of data packets will affect the accuracy of the tracking and location estimation of a mobile object. In addition, congestion in WSNs has negative impact on the performance, namely, decreased throughput, increased per-packet energy consumption and delay, thus congestion control is an important issue in WSNs. Consequentially, this paper aims to achieve both minimum energy consumption in reporting operation and balanced energy consumption among sensor nodes for WSN lifetime extension. Furthermore, data reliability is considered in our model where the sensed data can reach the sink node in a more reliable way. Finally, this paper presents a solution that sufficiently exerts the underloaded nodes to alleviate congestion and improve the overall throughput in WSNs. This work first formulates the problem as 0/1 Integer Linear Programming problem, and proposes a Reliable Energy Balance Traffic Aware greedy Algorithm in multi-sink WSNs (REBTAM) to solve the optimization problem. Through simulation, the performance of the proposed approach is evaluated and analyzed compared with the previous work which is related to our topic such as DTAR, NBPR, and MSDDGR protocols.     

Capacity and Channel Coding for Wireless Point-to-Point <Emphasis Type="Italic">Z</Emphasis><Superscript>2</Superscript> Channel

In this paper, we derive the capacity of the asymmetric \({\text{Z}}^{2}\)-channel, which has been presented for the first time as an optimization problem. Similar to the Z-Channel, the proposed \({\text{Z}}^{2}\)-channel can be modelled as a practical interference wireless channel. In addition, the capacity behavior of \({\text{Z}}^{2}\)-channel is discussed and some examples and simulation results for the capacity is presented. Also a code plan has been applied for \({\text{Z}}^{2}\)-channel, based on repetition code to simulate its performance and compare it with the original Z-channel. In conclusion, simulation results show that the \({\text{Z}}^{2}\)-channel can be used widely for different operating points.