应变纤锌矿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.     

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.

     

Software assurance practices for mobile applications

Mobile software applications have to cope with a particular environment that involves small size, limited resources, high autonomy requirements, competitive business models and many other challenges. To provide development guidelines that respond to these needs, several practices have been introduced; however, it is not clear how these guidelines may contribute to solve the issues present in the mobile domain. Furthermore, the rapid evolution of the mobile ecosystem challenges many of the premises upon which the proposed practices were designed. In this paper, we present a survey of the literature on software assurance practices for mobile applications, with the objective of describing them and assessing their contribution and success. We identified, organized and reviewed a body of research that spans in three levels: software development processes, software product assurance practices, and software implementation practices. By carrying out this literature survey, we reviewed the different approaches that researchers on Software Engineering have provided to address the needs that raise in the mobile software development arena. Moreover, we review the evolution of these practices, identifying how the constant changes and modernization of the mobile execution environment has impacted the methods proposed in the literature. Finally, we introduced discussion on the application of these practices in a real productive setting, opening an area for further research that may determine if practitioners have followed the proposed assurance paradigms.     

Is the List of Incomplete Open Cubes Complete?

Variations of Incomplete Open Cubes is the major project by the twentieth-century conceptual artist Sol LeWitt. In this paper we interpret the enumerative component of the project as embeddings of graphs. This formulation permits use of an algorithm to check the completeness of the list of the structures produced by the artist. Our conclusion is that the artist found the correct number of structures (that is, 122), but that his list contains a mistake in the presentation of a pair of incomplete cubes, a discovery that appears not to have been noted before.