Monitoring the Dynamic Process of Formation of Plasmonic Molecular Junctions during Single Nanoparticle Collisions

The capability to study the dynamic formation of plasmonic molecular junction is of fundamental importance, and it will provide new insights into molecular electronics/plasmonics, single‐entity electrochemistry, and nanooptoelectronics. Here, a facile method to form plasmonic molecular junctions is reported by utilizing single gold nanoparticle (NP) collision events at a highly curved gold nanoelectrode modified with a self‐assembled monolayer. By using time‐resolved electrochemical current measurement and surface‐enhanced Raman scattering spectroscopy, the current changes and the evolution of interfacial chemical bonding are successfully observed in the newly formed molecular tunnel junctions during and after the gold NP “hit‐n‐stay” and “hit‐n‐run” collision events. The results lead to an in‐depth understanding of the single NP motion and the associated molecular level changes during the formation of the plasmonic molecular junctions in a single NP collision event. This method also provides a new platform to study molecular changes at the single molecule level during electron transport in a dynamic molecular tunnel junction.     

A Two‐Stage Annealing Strategy for Crystallization Control of CH3NH3PbI3 Films toward Highly Reproducible Perovskite Solar Cells

The solvent‐engineering method is widely used to fabricate top‐performing perovskite solar cells, which, however, usually exhibit inferior reproducibility. Herein, a two‐stage annealing (TSA) strategy is demonstrated for processing of perovskite films, namely, annealing the intermediate phase at 60 °C for the first stage then at 100 °C for the second stage. Compared to conventional direct annealing temperature (DHA) at 100 °C, using this strategy, MAPbI₃ films become more controllable, leading to superior film uniformity and device reproducibility with the champion device efficiency reaching 19.8%. More specifically, the coefficient of variation of efficiency for 49 cells is reduced to 5.9%, compared to 9.8% for that using DHA. The TSA process is carefully studied using Fourier transform infrared spectroscopy, X‐ray diffraction, and UV–vis absorption spectroscopy. It is found that in comparison with DHA the formation of hydrogen bonding and crystallization of perovskite are much slower and can be better controlled when using TSA. The improvements in film uniformity and device reproducibility are attributed to: 1) controllable MAPbI₃ crystal growth stemming from the progressive formation of hydrogen bonding between methylammonium and halide; 2) suppression of intermediate phase film dewetting, which is believed to be due to its decreased mobility at the initial low‐temperature annealing stage.     

Memory effects of all‐solution‐processed oxide thin‐film transistors using ZnO nanoparticles

Abstract— Non‐volatile memory effects of an all‐solution‐processed oxide thin‐film transistor (TFT) with ZnO nanoparticles (NPs) as the charge‐trapping layer are reported. The device was fabricated by using a soluble MgInZnO active channel on a ZrHfO^x gate dielectric. ZnO NPs were used as the charge‐trapping site at the gate‐insulator—channel interface, and Al was used for source and drain electrodes. Transfer characteristics of the device showed a large clockwise hysteresis, which can be used to demonstrate its memory function due to electron trapping in the ZnO NP charge‐trapping layer. This memory effect has the potential to be utilized as a memory application on displays and disposable electronics.     

Parallelization of a dynamic SVD clustering algorithm and its application in information retrieval

We describe an implementation of a parallel document clustering scheme based on latent semantic indexing, which uses singular value decomposition. Given a set of documents, the clustering algorithm is dynamic in the sense that it automatically infers the number of clusters to be output. The parallel version has been implemented on a LAN and on a dual‐core system. Experimental evaluation of the algorithm shows an average speed‐up of 6.22 for the LAN implementation and an average speed‐up of 3.71 for the dual‐core implementation, while still maintaining a precision and recall in the range [0.85, 1]. To put these implementations in the context of information retrieval, we use the parallel clustering algorithm and develop a document similarity search system. The similarity search system shows good performance in terms of precision and recall. Copyright © 2010 John Wiley & Sons, Ltd.     

Guiding students to the right questions: adaptive navigation support in an E‐Learning system for Java programming

Rapid growth of the volume of interactive questions available to the students of modern E‐Learning courses placed the problem of personalized guidance on the agenda of E‐Learning researchers. Without proper guidance, students frequently select too simple or too complicated problems and ended either bored or discouraged. This paper explores a specific personalized guidance technology known as adaptive navigation support. We developed JavaGuide, a system, which guides students to appropriate questions in a Java programming course, and investigated the effect of personalized guidance a three‐semester long classroom study. The results of this study confirm the educational and motivational effects of adaptive navigation support.     

ADAPTIVE RANKS CLONE AND k‐NEAREST NEIGHBOR LIST–BASED IMMUNE MULTI‐OBJECTIVE OPTIMIZATION

Artificial immune systems (AIS) are computational systems inspired by the principles and processes of the vertebrate immune system. The AIS‐based algorithms typically exploit the immune system's characteristics of learning and adaptability to solve some complicated problems. Although, several AIS‐based algorithms have proposed to solve multi‐objective optimization problems (MOPs), little focus have been placed on the issues that adaptively use the online discovered solutions. Here, we proposed an adaptive selection scheme and an adaptive ranks clone scheme by the online discovered solutions in different ranks. Accordingly, the dynamic information of the online antibody population is efficiently exploited, which is beneficial to the search process. Furthermore, it has been widely approved that one‐off deletion could not obtain excellent diversity in the final population; therefore, a k‐nearest neighbor list (where k is the number of objectives) is established and maintained to eliminate the solutions in the archive population. The k‐nearest neighbors of each antibody are founded and stored in a list memory. Once an antibody with minimal product of k‐nearest neighbors is deleted, the neighborhood relations of the remaining antibodies in the list memory are updated. Finally, the proposed algorithm is tested on 10 well‐known and frequently used multi‐objective problems and two many‐objective problems with 4, 6, and 8 objectives. Compared with five other state‐of‐the‐art multi‐objective algorithms, namely NSGA‐II, SPEA2, IBEA, HYPE, and NNIA, our method achieves comparable results in terms of convergence, diversity metrics, and computational time.