Synthesis and Photophysical Properties of a Sc3N@C80‐Corrole Electron Donor–Acceptor Conjugate

Embedding endohdedral metallofullerenes (EMFs) into electron donor–acceptor systems is still a challenging task owing to their limited quantities and their still largely unexplored chemical properties. In this study, we have performed a 1,3‐dipolar cycloaddition reaction of a corrole‐based precursor with Sc₃N@C₈₀ to regioselectively form a [5,6]‐adduct ( 1 ). The successful attachment of the corrole moiety was confirmed by mass spectrometry. In the electronic ground state, absorption spectra suggest sizeable electronic communications between the electron acceptor and the electron donor. Moreover, the addition pattern occurring at a [5,6]‐bond junction is firmly proven by NMR spectroscopy and electrochemical investigations performed with 1 . In the electronically excited state, which is probed in photophysical assays with 1 , a fast electron‐transfer yields the radical ion pair state consisting of the one‐electron‐reduced Sc₃N@C₈₀ and of the one‐electron‐oxidized corrole upon its exclusive photoexcitation. As such, our results shed new light on the practical work utilizing EMFs as building blocks in photovoltaics.     

Optic Fiber Interferometer for Absolute Distance Measurement

1.IntroductionAbsolutedistancemeasurementisfarfromanewtopic.However,itisstillafieldstimulatinggreatinterestsnowadaysduetoitSimportantroleinmanufacturingandassembly['J.SincethegreatsuccessachievedbyMichelsonandBenoitwhentheyfirstdevelopedaninterferometertodeterminethestandardmeterintermsofthemonochromaticredcadmiumline,theopticinterferometerhasbeenprovedtobeoneofthemostpreciseandefficientwayindisplacementmeasurementbecauseofitshighdiscriminationandsimplestructure.However,thetraditionalinterfe…     

Necessary Conditions for Differentiability of Distance Functions

Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.     

Bit-parallel approximate string matching algorithms with transposition

Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms.     

基于MMD算法的HMM参数重估计的矩阵表示

本文提出的MMD算法用于提高模型区别错误信息和正确信息的能力．利用该算法在对模型的参数进行重估计时．涉及到复杂的目标函数的梯度运算．击运用矩阵运算使得梯度运算变得简单明了，因此本文给出了MMD算法下的HMM参数重估计的矩阵表示形式并给出了证明．     

连续照明时成像对比度与气象条件的关系

 通过同轴激光连续照明成像模型分析了大气后向散射对成像对比度的影响，得出了考虑散射因素时成像对比度的计算公式。基于不同气象条件下大气粒子散射特点，讨论了霾和雾两种不同天气时成像对比度随照明距离的变化规律，并与实验结果进行了对比，计算结果与实验吻合较好。     

Efficient synthesis of an aldehyde‐capped polythiophene containing fluorinated electron‐withdrawing groups

To incorporate an acceptor type polythiophene segment onto a supramolecular block copolymer for potential light harvesting applications, effective synthetic routes for the end‐functionalized and acceptor‐substituted polythiophenes are critical. The Ullmann coupling reaction can be utilized to obtain electron‐deficient polythiophenes and to attach terminal thiophene units that carry functional groups. In this article, the reactions involving a 2,5‐dibromothiophene monomer containing an electron‐withdrawing fluorinated ester and 5‐bromo‐2‐thiophenecarboxaldehyde (the end‐capper) were studied in detail. It was found that the Ullmann coupling reaction of the dibromide is very fast (completed in a few minutes) and the terminal bromine group does not survive long under the reaction condition. These findings lead to the development of an effective procedure for aldehyde end‐capping of electron‐deficient polythiophenes. Polymers with molecular weights around 4000 Da are routinely obtained. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 41–47, 2007     

The Hadamard Theorem and Borel–Carathéodory Theorem on Riemann Surfaces

In this paper, we first define a kind of pseudo–distance function and annulus domain on Riemann surfaces, then prove the Hadamard Theorem and the Borel–Carathéodory Theorem on any Riemann surfaces. Supported by NSFC 10501052