arXiv subjects

Shuyu Zhang

Publications and source records attributed to Shuyu Zhang.

21 records · Page 2Linked to original sources

arXiv2022

Localized State-Induced Enhanced Intrinsic Phonon-Free Optical Transition in Silicon Nanocrystals

Silicon photoluminescence and lasing have been critical issues to breakthrough bottlenecks in the understanding of luminescence mechanisms. Unfortunately, long-standing disputes about the exciton recombination mechanism and fluorescence lifetime remain unresolved, especially about whether silicon nanocrystals (Si NCs) can realize fast direct-bandgap-like optical transitions. Here, using ground-state and excited-state density functional theory (DFT), we obtained intrinsic phonon-free optical transitions at sizes from Si22 to Si705, showing that very small Si NCs can realize a strong direct optical transition. Orbital labeling results show that this rapid transition does not come from the Γ-Γ -like transition, contrary to the conclusions from the effective mass approximation (EMA) and that Γ-X mixing leads to a quasi-direct bandgap. This anomalous transition is particularly intense with decreasing size (or enhancement of quantum confinement). By investigating electron and hole distributions generated in the optical transition, localized state-induced enhanced emission (LIEE) in Si NCs was proposed. Quantum confinement (QC) distorts the excited-state electron spatial distribution by localizing Bloch waves into the NC core, resulting in increased hole and electron overlap, thus inducing a fast optical process. This work resolves important debates and proposes LIEE to explain the anomalous luminescence--a phase transition from weak (or none) luminescent state to strong optical transition, which will aid attempts at realizing high-radiative-rate NCs materials and application-level Si lasers.

cond-mat.mes-hall↗

arXiv2020

Privacy-preserving Traffic Flow Prediction: A Federated Learning Approach

Existing traffic flow forecasting approaches by deep learning models achieve excellent success based on a large volume of datasets gathered by governments and organizations. However, these datasets may contain lots of user's private data, which is challenging the current prediction approaches as user privacy is calling for the public concern in recent years. Therefore, how to develop accurate traffic prediction while preserving privacy is a significant problem to be solved, and there is a trade-off between these two objectives. To address this challenge, we introduce a privacy-preserving machine learning technique named federated learning and propose a Federated Learning-based Gated Recurrent Unit neural network algorithm (FedGRU) for traffic flow prediction. FedGRU differs from current centralized learning methods and updates universal learning models through a secure parameter aggregation mechanism rather than directly sharing raw data among organizations. In the secure parameter aggregation mechanism, we adopt a Federated Averaging algorithm to reduce the communication overhead during the model parameter transmission process. Furthermore, we design a Joint Announcement Protocol to improve the scalability of FedGRU. We also propose an ensemble clustering-based scheme for traffic flow prediction by grouping the organizations into clusters before applying FedGRU algorithm. Through extensive case studies on a real-world dataset, it is shown that FedGRU's prediction accuracy is 90.96% higher than the advanced deep learning models, which confirm that FedGRU can achieve accurate and timely traffic prediction without compromising the privacy and security of raw data.

cs.LG↗

arXiv2001

Compositional representation of protein sequences and the number of Eulerian loops

An amino acid sequence of a protein may be decomposed into consecutive overlapping strings of length K. How unique is the converse, i.e., reconstruction of amino acid sequences using the set of K-strings obtained in the decomposition? This problem may be transformed into the problem of counting the number of Eulerian loops in an Euler graph, though the well-known formula must be modified. By exhaustive enumeration and by using the modified formula we show that the reconstruction is unique at K equal or greater than 5 for an overwhelming majority of the proteins in the PDB.seq database. The corresponding Euler graphs provide a means to study the structure of repeated segments in protein sequences.

physics.bio-ph↗