应变纤锌矿ZnO/MgxZn1-xO量子点中离子施主束缚激子的光学性质

Within the framework of the effective-mass approximation and the dipole approximation, considering the three-dimensional confinement of the electron and hole and the strong built-in electric field(BEF) in strained wurtzite Zn O/Mg0:25Zn0:75O quantum dots(QDs), the optical properties of ionized donor-bound excitons(D+, X)are investigated theoretically using a variational method. The computations are performed in the case of finite band offset. Numerical results indicate that the optical properties of(D+, X) complexes sensitively depend on the donor position, the QD size and the BEF. The binding energy of(D+, X) complexes is larger when the donor is located in the vicinity of the left interface of the QDs, and it decreases with increasing QD size. The oscillator strength reduces with an increase in the dot height and increases with an increase in the dot radius. Furthermore, when the QD size decreases, the absorption peak intensity shows a marked increment, and the absorption coefficient peak has a blueshift. The strong BEF causes a redshift of the absorption coefficient peak and causes the absorption peak intensity to decrease remarkably. The physical reasons for these relationships have been analyzed in depth.     

亲子乐园空调送风方式的数值模拟研究

大型综合室内亲子乐园属于高大空间,设有游乐设施和游戏的特殊性使得对空间的舒适性要求一致,但是送风气流遇阻严重,室内存在较多气流死角,影响室内空气质量和儿童健康。因此其空调设计不仅需要考虑温度、风速的空间均匀度,还要考虑各点的空气龄和PMV-PPD指标。以天津某亲子乐园为研究对象,利用scSTREAM软件对适用于该房间的辐射供冷加新风、置换通风、混合通风三种空调方式的送风效果进行数值模拟分析,从流场的均匀性、人员的热舒适性等方面对模拟结果进行探讨,研究结果表明辐射供冷加新风方式的空间均匀性和PMV指标最佳,混合通风方式的空气龄最小。     

Distributed De La Garza algorithm for load-balancing routing in wireless sensor networks

Large scale wireless sensor networks raise many challenges in the design of efficient and effective routing algorithm due to their complexity and hardware constraints. However, the scalability challenge may be mitigated from a macroscopic perspective. One example is the distributed De la Garza iteration (DDLGI) algorithm for global routing load-balancing, based on a set of partial differential equations iteratively solved by the De la Garza method. We theoretically analyze the parallelism of DDLGI and illustrate that the region of interest may impact the degree of parallelism and error. Furthermore, though DDLGI always converges, the slow convergence and long-range information exchange problems may lead to excess energy consumption in communication. Thus, we propose various enhanced De la Garza routing (E-DLGR) algorithms to alleviate the energy consumption problem by which nodes may exchange less information and only need to exchange information with closer nodes to complete each iteration. Our theoretical analysis and simulation results show that the proposed E-DLGR algorithms may have less transmission overhead, thus further reducing energy consumption, and converge faster while still maintaining adequate accuracy.