Search

Specific bioconjugation for native primary amines is highly valuable for both chemistry and biomedical research. Despite all the efforts, scientists lack a proper strategy to achieve high selectivity for primary amines, not to mention the requirement of fast response in real applications. Herein, we report a chromone-based aggregation-induced emission (AIE) fluorogen called CMVMN as a self-reporting bioconjugation reagent for selective primary amine identification, and its applications for monitoring bioprocesses of amination and protein labeling. CMVMN is AIE-active and capable of solid-state sensing. Thus, its electrospun films are manufactured for visualization of amine diffusion and leakage process. CMVMN also shows good biocompatibility and potential mitochondria-staining ability, which provides new insight for organelle-staining probe design. Combined with its facile synthesis and good reversibility, CMVMN would not only show wide potential applications in biology, but also offer new possibilities for molecular engineering.

Long-persistent luminescence (LPL), also known as afterglow, is a phenomenon in which the material shows long-lasting luminescence after the cessation of the excitation source. The research of LPL continues to attract much interest due to its fundamental nature and its potential in the development of the next generation of functional materials. However, most of the current LPL materials are multicomponent inorganic systems obtained after harsh synthetic procedures and often use rare-earth metals. Recently, metal free organic long-persistent luminescence (OLPL) has gained much interest because it can bypass many of the disadvantages of inorganic systems. To date, the most successful method to generate OLPL systems is to access charge-separated states through binary donor-Acceptor exciplex systems. However, it has been reported that the ratios of the binary systems affect OLPL properties, complicating the reproducibility and large-scale production of OLPL materials. Simpler OLPL systems can overcome these issues for the benefit of the development and adoption of OLPL systems. Here, we report on the rational design and synthesis of a single-component OLPL system with detectable afterglow for at least 12 min under ambient conditions. This work exemplifies an easy design principle for new OLPL materials. The investigation of the material provides valuable insights toward the generation of OLPL from a single-component system.

Organic and inorganic clusteroluminescence have attracted great attention while the underlying mechanisms is still not well understood. Here, we employed a series of ancient inorganic complexes platinocyanides with aggregation‐induced emission property to elucidate the mechanism of clusteroluminescence including how does the chromophore form and how does the solid structures influence the luminescence behaviors. The results indicate that the isolated platinocyanide cannot work as a chromophore to emit visible light, while their clusterization at aggregate state can trigger the d‐orbitals coupling of the platinum atoms to facilitate the electron exchange and delocalization to form a new chromophore to emit visible light. Furthermore, the counter ions and H2O ligands help to rigidify the three‐dimensional network structure of the platinocyanides to suppress the excited state nonradiative decay, resulting in the high quantum yield of up to 96%. This work fundamentally helps understanding both the organic and inorganic clusteroluminescence phenomenon.

Long-lived emission or afterglow is an interesting phenomenon which usually refers to long lasting visible emission after the cease of excitation sources. Owing to its unique properties, fundamental importance, and potential in development of advanced technological applications, it attracts researcher’s interests from different fields. Based on fundamental differences, it can be divided into phosphorescence and persistent luminescence. About the underlying mechanism of these two kinds of emission, it is related to the photophysics of long-lived excited states presented in the systems. More mechanistic insights and rational understanding is needed for designing new afterglow materials and functional applications with desired properties. Thus, exploring the long-lived excited states is crucial for the research of afterglow material and it can lead to a more comprehensive progress. In this thesis, organic material that exhibit room temperature phosphorescence (RTP) and long-persistent luminescence (LPL) are investigated through photophyscal approaches. Different molecular design and strategies based on monitoring long-lived states have been employed to realize new RTP and LPL systems. This thesis demonstrates the insights by giving rational understanding and novel examples to the research of organic afterglow material.

Organic and inorganic clusteroluminescence have attracted great attention while the underlying mechanisms is still not well understood. Here, we employed a series of ancient inorganic complexes platinocyanides with aggregation‐induced emission property to elucidate the mechanism of clusteroluminescence including how does the chromophore form and how does the solid structures influence the luminescence behaviors. The results indicate that the isolated platinocyanide cannot work as a chromophore to emit visible light, while their clusterization at aggregate state can trigger the d‐orbitals coupling of the platinum atoms to facilitate the electron exchange and delocalization to form a new chromophore to emit visible light. Furthermore, the counter ions and H2O ligands help to rigidify the three‐dimensional network structure of the platinocyanides to suppress the excited state nonradiative decay, resulting in the high quantum yield of up to 96%. This work fundamentally helps understanding both the organic and inorganic clusteroluminescence phenomenon.

Because of their innate ability to store and then release energy, long-persistent luminescence (LPL) materials have garnered strong research interest in a wide range of multidisciplinary fields, such as biomedical sciences, theranostics, and photonic devices. Although many inorganic LPL systems with afterglow durations of up to hours and days have been reported, organic systems have had difficulties reaching similar timescales. In this work, a design principle based on the successes of inorganic systems to produce an organic LPL (OLPL) system through the use of a strong organic electron trap is proposed. The resulting system generates detectable afterglow for up to 7 h, significantly longer than any other reported OLPL system. The design strategy demonstrates an easy methodology to develop organic long-persistent phosphors, opening the door to new OLPL materials. © 2020 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim

Persistent luminescence is a fascinating phenomenon with exceptional applications. However, the development of organic materials capable of persistent luminescence, such as organic persistent room-temperature phosphorescence, lags behind for their normally low efficiency. Moreover, enhancing the phosphorescence efficiency of organic luminophores often results in short lifetime, which sets an irreconcilable obstacle. Here we report a strategy to boost the efficiency of phosphorescence by intramolecular triplet-triplet energy transfer. Incorpotation of (bromo) dibenzofuran or (bromo) dibenzothiophene to carbazole has boosted the intersystem crossing and provided an intramolecular triplet-state bridge to offer a near quantitative exothermic triplet-triplet energy transfer to repopulate the lowest triplet-state of carbazole. All these factors work together to contribute the efficient phosphorescence. The generation and transfer of triplet excitons within a single molecule is revealed by low-temperature spectra, energy level and lifetime investigations. The strategy developed here will enable the development of efficient phosphorescent materials for potential high-tech applications.

by Tsz Shing Cheung., Thesis (M.Phil.)--Chinese University of Hong Kong, 1990., Includes bibliographical references., Chapter Section 1 --- Introduction --- p.2, Chapter 1.1 --- The Affinity Clustering Phase --- p.2, Chapter 1.2 --- The Alteration Phase --- p.3, Chapter 1.3 --- Floorplan of Macrocell Array --- p.3, Chapter 1.4 --- Chip Model --- p.4, Chapter 1.4.1 --- Location Representation --- p.4, Chapter 1.4.2 --- Interconnection Length Estimation --- p.6, Chapter 1.5 --- Cost Function Evaluation --- p.6, Chapter 1.5.1 --- Net-length Calculation --- p.6, Chapter 1.5.2 --- Net-length Estimated by Half of the Perimeter of Bounding Box --- p.7, Chapter 1.6 --- Thesis Layout --- p.8, Chapter Section 2 --- Reviews of Partitioning and Placement Methods --- p.9, Chapter 2.1 --- Partitioning Methods --- p.9, Chapter 2.1.1 --- Direct Method --- p.10, Chapter 2.1.2 --- Group Migration Method --- p.10, Chapter 2.1.3 --- Metric Allocation Methods --- p.10, Chapter 2.1.4 --- Simulated Annealing --- p.11, Chapter 2.2 --- Placement Methods --- p.12, Chapter 2.2.1 --- Min-cut Methods --- p.13, Chapter 2.2.2 --- Affinity Clustering Methods --- p.13, Chapter 2.2.3 --- Other Placement Methods --- p.16, Chapter Section 3 --- Algorithm --- p.17, Chapter 3.1 --- The Affinity Clustering Phase --- p.18, Chapter 3.1.1 --- Construction of Connection Lists --- p.18, Chapter 3.1.2 --- Primary Grouping --- p.21, Chapter 3.1.3 --- Element Appendage to Existing Groups --- p.23, Chapter 3.1.4 --- Loose Appendage of Ungrouped Elements --- p.25, Chapter 3.1.5 --- Single Element Groups Formation --- p.26, Chapter 3.2 --- The Alteration Phase --- p.27, Chapter 3.2.1 --- Element Assignment to a Group --- p.29, Chapter 3.2.2 --- Empty Space Searching --- p.30, Chapter 3.2.3 --- Determination of Direction of Element Allocation --- p.31, Chapter 3.2.3.1 --- Cross-cut Direction of Allocation --- p.32, Chapter 3.2.3.2 --- Dynamic Determination of Path Based on Size Functions --- p.34, Chapter 3.2.3.2.1 --- Segmentation of Cross-cut --- p.35, Chapter 3.2.3.2.2 --- Partial Optimization of Segments --- p.36, Chapter 3.2.3.2.3 --- Dynamic Linking of Segments --- p.38, Chapter 3.2.4 --- Element Allocation --- p.39, Chapter Section 4 --- Implementation --- p.41, Chapter 4.1 --- The System Row --- p.41, Chapter 4.1.1 --- The Affinity Clustering Phase --- p.43, Chapter 4.1.2 --- The Alteration Phase --- p.44, Chapter 4.2 --- Data Structures --- p.47, Chapter 4.2.1 --- Insertion of Elements to a Linked List --- p.54, Chapter 4.2.2 --- Dynamic Linking of Segments --- p.56, Chapter 4.2.3 --- Advantages of the Dynamic Data Structure --- p.59, Chapter 4.3 --- Data Manipulation and File Management --- p.60, Chapter 4.3.1 --- The Connection Lists and the Group List --- p.60, Chapter 4.3.2 --- Description on Programs and Data Files --- p.62, Chapter 4.3.2.1 --- The Affinity Clustering Phase --- p.63, Chapter 4.3.2.2 --- The Alteration Phase --- p.64, Chapter Section 5 --- Results --- p.70, Chapter 5.1 --- Results on Affinity Clustering Phase --- p.84, Chapter 5.2 --- Details of Affinity Clustering Procedure on Ckt. 2 and Ckt. 5 --- p.92, Chapter 5.3 --- Results on Alteration Phase --- p.97, Chapter 5.4 --- Details of Alteration Procedure on Ckt. 2 and Ckt. 5 --- p.101, Chapter Section 6 --- Discussion --- p.107, Chapter 6.1 --- Computation Time of the Algorithm --- p.107, Chapter 6.2 --- Alternative Methods on the Determination of Propagation Path --- p.110, Chapter 6.2.1 --- Method 1 --- p.110, Chapter 6.2.2 --- Method 2 --- p.111, Chapter 6.2.3 --- Method 3 --- p.114, Chapter 6.2.4 --- Comparison on Execution Time of the Four Methods --- p.117, Chapter 6.3 --- Wiring Optimization --- p.118, Chapter 6.3.1 --- Data Structure --- p.119, Chapter 6.3.2 --- Overlapping and Separate Bounding Boxes --- p.120, Chapter 6.4 --- Generalization of the Data Structure --- p.122, Chapter 6.4.1 --- Cell Types --- p.123, Chapter 6.4.2 --- Adhesive Attributes --- p.124, Chapter 6.4.3 --- Blocks Representation --- p.124, Chapter 6.4.4 --- Critical Path Adjustment --- p.125, Chapter 6.4.5 --- Total Interconnection Length Estimation --- p.129, Chapter 6.5 --- A New Placement Algorithm --- p.130, Chapter 6.6 --- An Alternative Method on Element Allocation --- p.132, Chapter Section 7 --- Conclusion --- p.136, Chapter Section 8 --- References --- p.138, Chapter Section 9 --- Appendix I --- p.142, Chapter 9.1 --- Definition of the Problem --- p.142, Chapter 9.2 --- The Simulated Annealing Algorithm --- p.142, Chapter 9.3 --- Example Circuit --- p.143, Chapter 9.4 --- Performance Indices and Energy Value --- p.144, Chapter 9.4.1 --- Total Interconnection Length --- p.144, Chapter 9.4.2 --- Delay on Critical Paths --- p.144, Chapter 9.4.3 --- Skew in Input-to-Output Delays --- p.146, Chapter 9.4.4 --- Energy Value --- p.146, Chapter 9.5 --- The Simulation Program --- p.146, Chapter 9.5.1 --- "The ""function"" Subroutines" --- p.147, Chapter 9.5.1.1 --- alise --- p.147, Chapter 9.5.1.2 --- max delay --- p.147, Chapter 9.5.1.3 --- replace --- p.147, Chapter 9.5.1.4 --- total length --- p.147, Chapter 9.5.2 --- "The ""procedure"" Subroutines" --- p.148, Chapter 9.5.2.1 --- init_weight --- p.148, Chapter 9.5.2.2 --- inverse --- p.148, Chapter 9.5.2.3 --- initial --- p.148, Chapter 9.5.2.4 --- shuffle --- p.148, Chapter 9.5.3 --- The Main Program --- p.148, Chapter 9.6 --- Results and Discussion --- p.149, Chapter 9.7 --- Summary --- p.156, Chapter 9.8 --- References --- p.156, Chapter Section 10 --- Appendix II --- p.157, http://library.cuhk.edu.hk/record=b5886910, Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/)

by Tsz Shing Cheung., Thesis (M.Phil.)--Chinese University of Hong Kong, 1990., Includes bibliographical references., Chapter Section 1 --- Introduction --- p.2, Chapter 1.1 --- The Affinity Clustering Phase --- p.2, Chapter 1.2 --- The Alteration Phase --- p.3, Chapter 1.3 --- Floorplan of Macrocell Array --- p.3, Chapter 1.4 --- Chip Model --- p.4, Chapter 1.4.1 --- Location Representation --- p.4, Chapter 1.4.2 --- Interconnection Length Estimation --- p.6, Chapter 1.5 --- Cost Function Evaluation --- p.6, Chapter 1.5.1 --- Net-length Calculation --- p.6, Chapter 1.5.2 --- Net-length Estimated by Half of the Perimeter of Bounding Box --- p.7, Chapter 1.6 --- Thesis Layout --- p.8, Chapter Section 2 --- Reviews of Partitioning and Placement Methods --- p.9, Chapter 2.1 --- Partitioning Methods --- p.9, Chapter 2.1.1 --- Direct Method --- p.10, Chapter 2.1.2 --- Group Migration Method --- p.10, Chapter 2.1.3 --- Metric Allocation Methods --- p.10, Chapter 2.1.4 --- Simulated Annealing --- p.11, Chapter 2.2 --- Placement Methods --- p.12, Chapter 2.2.1 --- Min-cut Methods --- p.13, Chapter 2.2.2 --- Affinity Clustering Methods --- p.13, Chapter 2.2.3 --- Other Placement Methods --- p.16, Chapter Section 3 --- Algorithm --- p.17, Chapter 3.1 --- The Affinity Clustering Phase --- p.18, Chapter 3.1.1 --- Construction of Connection Lists --- p.18, Chapter 3.1.2 --- Primary Grouping --- p.21, Chapter 3.1.3 --- Element Appendage to Existing Groups --- p.23, Chapter 3.1.4 --- Loose Appendage of Ungrouped Elements --- p.25, Chapter 3.1.5 --- Single Element Groups Formation --- p.26, Chapter 3.2 --- The Alteration Phase --- p.27, Chapter 3.2.1 --- Element Assignment to a Group --- p.29, Chapter 3.2.2 --- Empty Space Searching --- p.30, Chapter 3.2.3 --- Determination of Direction of Element Allocation --- p.31, Chapter 3.2.3.1 --- Cross-cut Direction of Allocation --- p.32, Chapter 3.2.3.2 --- Dynamic Determination of Path Based on Size Functions --- p.34, Chapter 3.2.3.2.1 --- Segmentation of Cross-cut --- p.35, Chapter 3.2.3.2.2 --- Partial Optimization of Segments --- p.36, Chapter 3.2.3.2.3 --- Dynamic Linking of Segments --- p.38, Chapter 3.2.4 --- Element Allocation --- p.39, Chapter Section 4 --- Implementation --- p.41, Chapter 4.1 --- The System Row --- p.41, Chapter 4.1.1 --- The Affinity Clustering Phase --- p.43, Chapter 4.1.2 --- The Alteration Phase --- p.44, Chapter 4.2 --- Data Structures --- p.47, Chapter 4.2.1 --- Insertion of Elements to a Linked List --- p.54, Chapter 4.2.2 --- Dynamic Linking of Segments --- p.56, Chapter 4.2.3 --- Advantages of the Dynamic Data Structure --- p.59, Chapter 4.3 --- Data Manipulation and File Management --- p.60, Chapter 4.3.1 --- The Connection Lists and the Group List --- p.60, Chapter 4.3.2 --- Description on Programs and Data Files --- p.62, Chapter 4.3.2.1 --- The Affinity Clustering Phase --- p.63, Chapter 4.3.2.2 --- The Alteration Phase --- p.64, Chapter Section 5 --- Results --- p.70, Chapter 5.1 --- Results on Affinity Clustering Phase --- p.84, Chapter 5.2 --- Details of Affinity Clustering Procedure on Ckt. 2 and Ckt. 5 --- p.92, Chapter 5.3 --- Results on Alteration Phase --- p.97, Chapter 5.4 --- Details of Alteration Procedure on Ckt. 2 and Ckt. 5 --- p.101, Chapter Section 6 --- Discussion --- p.107, Chapter 6.1 --- Computation Time of the Algorithm --- p.107, Chapter 6.2 --- Alternative Methods on the Determination of Propagation Path --- p.110, Chapter 6.2.1 --- Method 1 --- p.110, Chapter 6.2.2 --- Method 2 --- p.111, Chapter 6.2.3 --- Method 3 --- p.114, Chapter 6.2.4 --- Comparison on Execution Time of the Four Methods --- p.117, Chapter 6.3 --- Wiring Optimization --- p.118, Chapter 6.3.1 --- Data Structure --- p.119, Chapter 6.3.2 --- Overlapping and Separate Bounding Boxes --- p.120, Chapter 6.4 --- Generalization of the Data Structure --- p.122, Chapter 6.4.1 --- Cell Types --- p.123, Chapter 6.4.2 --- Adhesive Attributes --- p.124, Chapter 6.4.3 --- Blocks Representation --- p.124, Chapter 6.4.4 --- Critical Path Adjustment --- p.125, Chapter 6.4.5 --- Total Interconnection Length Estimation --- p.129, Chapter 6.5 --- A New Placement Algorithm --- p.130, Chapter 6.6 --- An Alternative Method on Element Allocation --- p.132, Chapter Section 7 --- Conclusion --- p.136, Chapter Section 8 --- References --- p.138, Chapter Section 9 --- Appendix I --- p.142, Chapter 9.1 --- Definition of the Problem --- p.142, Chapter 9.2 --- The Simulated Annealing Algorithm --- p.142, Chapter 9.3 --- Example Circuit --- p.143, Chapter 9.4 --- Performance Indices and Energy Value --- p.144, Chapter 9.4.1 --- Total Interconnection Length --- p.144, Chapter 9.4.2 --- Delay on Critical Paths --- p.144, Chapter 9.4.3 --- Skew in Input-to-Output Delays --- p.146, Chapter 9.4.4 --- Energy Value --- p.146, Chapter 9.5 --- The Simulation Program --- p.146, Chapter 9.5.1 --- "The ""function"" Subroutines" --- p.147, Chapter 9.5.1.1 --- alise --- p.147, Chapter 9.5.1.2 --- max delay --- p.147, Chapter 9.5.1.3 --- replace --- p.147, Chapter 9.5.1.4 --- total length --- p.147, Chapter 9.5.2 --- "The ""procedure"" Subroutines" --- p.148, Chapter 9.5.2.1 --- init_weight --- p.148, Chapter 9.5.2.2 --- inverse --- p.148, Chapter 9.5.2.3 --- initial --- p.148, Chapter 9.5.2.4 --- shuffle --- p.148, Chapter 9.5.3 --- The Main Program --- p.148, Chapter 9.6 --- Results and Discussion --- p.149, Chapter 9.7 --- Summary --- p.156, Chapter 9.8 --- References --- p.156, Chapter Section 10 --- Appendix II --- p.157, http://library.cuhk.edu.hk/record=b5886910, Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/)