Two-dimensional Ruddlesden-Popper(2DRP)perovskite exhibits excellent stability in perovskite solar cells(PSCs)due to introducing hydrophobic long-chain organic spacers.However,the poor charge transporting property of ...Two-dimensional Ruddlesden-Popper(2DRP)perovskite exhibits excellent stability in perovskite solar cells(PSCs)due to introducing hydrophobic long-chain organic spacers.However,the poor charge transporting property of bulky organic cation spacers limits the performance of 2DRP PSCs.Inspired by the Asite cation alloying strategy in 3D perovskites,2DRP perovskites with a binary spacer can promote charge transporting compared to the unary spacer counterparts.Herein,the superior MA-based 2DRP perovskite films with a binary spacer,including 3-guanidinopropanoic acid(GPA)and 4-fluorophenethylamine(FPEA)are realized.These films(GPA_(0.85)FPEA_(0.15))_(2)MA_(4)Pb_5I_(16)show good morphology,large grain size,decreased trap state density,and preferential orientation of the as-prepared film.Accordingly,the present 2DRP-based PSC with the binary spacer achieves a remarkable efficiency of 18.37%with a V_(OC)of1.15 V,a J_(SC)of 20.13 mA cm^(-2),and an FF of 79.23%.To our knowledge,the PCE value should be the highest for binary spacer MA-based 2DRP(n≤5)PSCs to date.Importantly,owing to the hydrophobic fluorine group of FPEA and the enhanced interlayer interaction by FPEA,the unencapsulated 2DRP PSCs based on binary spacers exhibit much excellent humidity stability and thermal stability than the unary spacer counterparts.展开更多
Based on detailed analysis of advantages and disadvantages of the existing connected-component labeling （CCL） algorithm,a new algorithm for binary connected components labeling based on run-length encoding （RLE） a...Based on detailed analysis of advantages and disadvantages of the existing connected-component labeling （CCL） algorithm,a new algorithm for binary connected components labeling based on run-length encoding （RLE） and union-find sets has been put forward.The new algorithm uses RLE as the basic processing unit,converts the label merging of connected RLE into sets grouping in accordance with equivalence relation,and uses the union-find sets which is the realization method of sets grouping to solve the label merging of connected RLE.And the label merging procedure has been optimized：the union operation has been modified by adding the ＂weighted rule＂ to avoid getting a degenerated-tree,and the ＂path compression＂ has been adopted when implementing the find operation,then the time complexity of label merging is O（nα（n））.The experiments show that the new algorithm can label the connected components of any shapes very quickly and exactly,save more memory,and facilitate the subsequent image analysis.展开更多
The optimal velocity encoding of phase-contrast magnetic resonance angiography （PC MRA） in measuring cerebral blood flow volume （BFV） ranges from 60 to 80 cm/s. To verify the accuracy of two-dimensional （2D） PC ...The optimal velocity encoding of phase-contrast magnetic resonance angiography （PC MRA） in measuring cerebral blood flow volume （BFV） ranges from 60 to 80 cm/s. To verify the accuracy of two-dimensional （2D） PC MRA, the present study localized the region of interest at blood vessels of the neck using PC MRA based on three-dimensional time-of-flight sequences, and the velocity encoding was set to 80 cm/s. Results of the measurements showed that the error rate was 7.0±6.0% in the estimation of BFV in the internal carotid artery, the external carotid artery and the ipsilateral common carotid artery. There was no significant difference, and a significant correlation in BFV between internal carotid artery ＋ external carotid artery and ipsilateral common carotid artery. In addition, the BFV of the common carotid artery was correlated with that of the ipsilateral internal carotid artery. The main error was attributed to the external carotid artery and its branches. Therefore, after selecting the appropriate scanning parameters and protocols, 2D PC MRA is more accurate in the determination of BFV in the carotid arteries.展开更多
The designing,encodings and an instance of simulation of a binary tree for DNA computer were proposed,which utilizes the method of biology to complete inserting and deleting of the binary tree. Firstly,DNA encodings f...The designing,encodings and an instance of simulation of a binary tree for DNA computer were proposed,which utilizes the method of biology to complete inserting and deleting of the binary tree. Firstly,DNA encodings for storage and all elements of the binary tree were completely given out. Then, the implementations of all bio-operations in DNA computer were described. Finally, to prove the feasibility of this method, an actual binary tree with detailed nucleotide encodings was introduced. The process of an algorithm implemented on this binary tree was demonstrated. Based on this method, more other data structures in DNA computer can be developed.展开更多
We propose a novel binary image representation algorithm using the non-symmetry and anti-packing model and the coordinate encoding procedure （NAMCEP）. By tak- ing some idiomatic standard binary images in the field o...We propose a novel binary image representation algorithm using the non-symmetry and anti-packing model and the coordinate encoding procedure （NAMCEP）. By tak- ing some idiomatic standard binary images in the field of image processing as typical test objects, and by comparing our proposed NAMCEP representation with linear quadtree （LQT）, binary tree （Bintree）, non-symmetry and anti-packing model （NAM） with K-lines （NAMK）, and NAM representa- tions, we show that NAMCEP can not only reduce the aver- age node, but also simultaneously improve the average com- pression. We also present a novel NAMCEP-based algorithm for area calculation and show experimentally that our algo- rithm offers significant improvements.展开更多
基金financially supported by the Natural Science Foundation of China(Grant Nos.52372226,52173263,62004167)the Natural Science Basic Research Plan in Shaanxi Province of China(Grant Nos.2022JM-315,2023-JC-QN-0643)+4 种基金the National Key R&D Program of China(Grant No.2022YFB3603703)the Qinchuangyuan High-level Talent Project of Shaanxi(Grant No.QCYRCXM-2022-219)the Ningbo Natural Science Foundation(Grant No.2022J061)the Key Research and Development Program of Shaanxi(Grant No.2023GXLH-091)the Shccig-Qinling Program and the Fundamental Research Funds for the Central Universities。
文摘Two-dimensional Ruddlesden-Popper(2DRP)perovskite exhibits excellent stability in perovskite solar cells(PSCs)due to introducing hydrophobic long-chain organic spacers.However,the poor charge transporting property of bulky organic cation spacers limits the performance of 2DRP PSCs.Inspired by the Asite cation alloying strategy in 3D perovskites,2DRP perovskites with a binary spacer can promote charge transporting compared to the unary spacer counterparts.Herein,the superior MA-based 2DRP perovskite films with a binary spacer,including 3-guanidinopropanoic acid(GPA)and 4-fluorophenethylamine(FPEA)are realized.These films(GPA_(0.85)FPEA_(0.15))_(2)MA_(4)Pb_5I_(16)show good morphology,large grain size,decreased trap state density,and preferential orientation of the as-prepared film.Accordingly,the present 2DRP-based PSC with the binary spacer achieves a remarkable efficiency of 18.37%with a V_(OC)of1.15 V,a J_(SC)of 20.13 mA cm^(-2),and an FF of 79.23%.To our knowledge,the PCE value should be the highest for binary spacer MA-based 2DRP(n≤5)PSCs to date.Importantly,owing to the hydrophobic fluorine group of FPEA and the enhanced interlayer interaction by FPEA,the unencapsulated 2DRP PSCs based on binary spacers exhibit much excellent humidity stability and thermal stability than the unary spacer counterparts.
文摘Based on detailed analysis of advantages and disadvantages of the existing connected-component labeling （CCL） algorithm,a new algorithm for binary connected components labeling based on run-length encoding （RLE） and union-find sets has been put forward.The new algorithm uses RLE as the basic processing unit,converts the label merging of connected RLE into sets grouping in accordance with equivalence relation,and uses the union-find sets which is the realization method of sets grouping to solve the label merging of connected RLE.And the label merging procedure has been optimized：the union operation has been modified by adding the ＂weighted rule＂ to avoid getting a degenerated-tree,and the ＂path compression＂ has been adopted when implementing the find operation,then the time complexity of label merging is O（nα（n））.The experiments show that the new algorithm can label the connected components of any shapes very quickly and exactly,save more memory,and facilitate the subsequent image analysis.
基金the Medical Program of Scientific & Technical Foundation in Xiamen in 2008, No. 3502Z20084028
文摘The optimal velocity encoding of phase-contrast magnetic resonance angiography （PC MRA） in measuring cerebral blood flow volume （BFV） ranges from 60 to 80 cm/s. To verify the accuracy of two-dimensional （2D） PC MRA, the present study localized the region of interest at blood vessels of the neck using PC MRA based on three-dimensional time-of-flight sequences, and the velocity encoding was set to 80 cm/s. Results of the measurements showed that the error rate was 7.0±6.0% in the estimation of BFV in the internal carotid artery, the external carotid artery and the ipsilateral common carotid artery. There was no significant difference, and a significant correlation in BFV between internal carotid artery ＋ external carotid artery and ipsilateral common carotid artery. In addition, the BFV of the common carotid artery was correlated with that of the ipsilateral internal carotid artery. The main error was attributed to the external carotid artery and its branches. Therefore, after selecting the appropriate scanning parameters and protocols, 2D PC MRA is more accurate in the determination of BFV in the carotid arteries.
文摘The designing,encodings and an instance of simulation of a binary tree for DNA computer were proposed,which utilizes the method of biology to complete inserting and deleting of the binary tree. Firstly,DNA encodings for storage and all elements of the binary tree were completely given out. Then, the implementations of all bio-operations in DNA computer were described. Finally, to prove the feasibility of this method, an actual binary tree with detailed nucleotide encodings was introduced. The process of an algorithm implemented on this binary tree was demonstrated. Based on this method, more other data structures in DNA computer can be developed.
基金We thank the anonymous reviewers and editors for their valuable comments on improving this paper. This work was supported by the National Natural Science Foundation of China （Grant No. 61300134）, the Research Fund for the Doctoral Program of Higher Education of China （20120172120036）, the Natural Science Foundation of Guangdong Province of China （S2011040005815 and S2013010012515）, the Foundation for Dis- tinguished Young Talents in Higher Education of Guangdong of China （LYM11015）, and the Fundamental Research Funds for the Central Universities of China （2011ZM0074 and 2013ZZ0050）.
文摘We propose a novel binary image representation algorithm using the non-symmetry and anti-packing model and the coordinate encoding procedure （NAMCEP）. By tak- ing some idiomatic standard binary images in the field of image processing as typical test objects, and by comparing our proposed NAMCEP representation with linear quadtree （LQT）, binary tree （Bintree）, non-symmetry and anti-packing model （NAM） with K-lines （NAMK）, and NAM representa- tions, we show that NAMCEP can not only reduce the aver- age node, but also simultaneously improve the average com- pression. We also present a novel NAMCEP-based algorithm for area calculation and show experimentally that our algo- rithm offers significant improvements.
