Functionalized Silver-Ion-Mediated α-dC/β-dC Hybrid Base Pairs with Exceptional Stability: α-d-5-Iodo-2′-Deoxycytidine and Its Octadiynyl Derivative in Metal DNA

Silver-mediated α-dC–Ag⁺–β-dC hybrid base pairs decorated with 5-iodo- or 5-octadiynyl residues are well accommodated in duplex DNA. A strong T_m increase and favorable thermodynamic data for duplex DNA were observed after addition of silver ions. The phenomenon is particularly obvious when both nucleobases of the base pairs are functionalized. Neither the position of the base pair, nor the type of 5-substituent had a negative influence. On the contrary, functionalization of conventional silver-mediated β-dC–Ag⁺–β-dC homo base pairs showed a negative impact induced by the bulky substituents. To this end, cytosine modified 12-mer oligodeoxynucleotides were prepared by solid-phase synthesis employing new α-anomeric 2′-deoxycytidine phosphoramidites. A multigram scale synthesis was developed for 5-iodo-α-d -2′-deoxycytidine ( 1 ) employing the direct glycosylation of cytosine with Hoffer's α-d -halogenose followed by separation of anomeric DMT nucleosides. Regarding base-pair stability and functionalization silver-mediated α/β-dC hybrid base pairs were found to be superior to β/β-dC homo pairs. According to their extraordinary properties, they might find applications in DNA diagnostics, material science, or nanotechnology.     

Enhancing the Water Stability of Al‐MIL‐101‐NH2 via Postsynthetic Modification

The resistance of metal–organic frameworks towards water is a very critical issue concerning their practical use. Recently, it was shown for microporous MOFs that the water stability could be increased by introducing hydrophobic pendant groups. Here, we demonstrate a remarkable stabilisation of the mesoporous MOF Al‐MIL‐101‐NH₂ by postsynthetic modification with phenyl isocyanate. In this process 86 % of the amino groups were converted into phenylurea units. As a consequence, the long‐term stability of Al‐MIL‐101‐URPh in liquid water could be extended beyond a week. In water saturated atmospheres Al‐MIL‐101‐URPh decomposed at least 12‐times slower than the unfunctionalised analogue. To study the underlying processes both materials were characterised by Ar, N₂ and H₂O sorption measurements, powder X‐ray diffraction, thermogravimetric and chemical analysis as well as solid‐state NMR and IR spectroscopy. Postsynthetic modification decreased the BET equivalent surface area from 3363 to 1555 m² g^?1 for Al‐MIL‐101‐URPh and reduced the mean diameters of the mesopores by 0.6 nm without degrading the structure significantly and reducing thermal stability. In spite of similar water uptake capacities, the relative humidity‐dependent uptake of Al‐MIL‐101‐URPh is slowed and occurs at higher relative humidity values. In combination with ¹H‐²⁷Al D ‐HMQC NMR spectroscopy experiments this favours a shielding mechanism of the Al clusters by the pendant phenyl groups and rules out pore blocking.     

属间远缘杂交水稻耐旱性生理特性的比较研究

采用在ＹＯＳＨＩＤＡ水稻专用培养营养液中添加一定量的ＰＥＧ ６０００的方法，比较研究了模拟干旱胁迫条件下属间远缘杂交新型水稻品种“远诱１号”（Ｙ）及其水稻亲本“圭６３０”（Ｇ）、高梁亲本“桃长红”（Ｔ）以及生产推广杂交组合“汕优６３”（Ｓ）等试验材料某些生态生理特性的差异。研究结果表明，在－１．０ＭＰａ的高渗胁迫下，Ｙ、Ｇ、Ｔ的萌发系数均有不同程度的下降，正常培养条件下的萌发系数ＧＣ分别为３６．９     

Stochastic techniques for global optimization: A survey of recent advances

In this paper stochastic algorithms for global optimization are reviewed. After a brief introduction on random-search techniques, a more detailed analysis is carried out on the application of simulated annealing to continuous global optimization. The aim of such an analysis is mainly that of presenting recent papers on the subject, which have received only scarce attention in the most recent published surveys. Finally a very brief presentation of clustering techniques is given.     

Approximation algorithms for dynamic resource allocation

We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

On the analysis of a dynamic evolutionary algorithm

Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability.     

Scale Invariance Properties in the Simulated Annealing Algorithm

The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed.     

混合判断矩阵排序方法研究

本文介绍了混合判断矩阵及完全一致性混合判断矩阵的概念，提出了混合判断矩阵排序的一种最小偏差法，并给出了其收敛性迭代算法，最后通过算例说明了方法的可行性。     

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.