Photonic Crystal Palette of Binary Block Copolymer Blends for Full Visible Structural Color Encryption

Structural color (SC) arising from a periodically ordered self-assembled block copolymer (BCP) photonic crystal (PC) is useful for reflective-mode sensing displays owing to its capability of stimuli-responsive structure alteration. However, a set of PC inks, each providing a precisely addressable SC in the full visible range, has rarely been demonstrated. Here, a strategy for developing BCP PC inks with tunable structures is presented. This involves solution-blending of two lamellar-forming BCPs with different molecular weights. By controlling the mixing ratio of the two BCPs, a thin 1D BCP PC film is developed with alternating in-plane lamellae whose periodicity varies linearly from ≈46 to ≈91 nm. Subsequent preferential swelling of one-type lamellae with either solvent or non-volatile ionic liquid causes the photonic band gap of the films to red-shift, giving rise to full-visible-range SC correlated with the pristine nanostructures of the blended films in both liquid and solid states. The BCP PC palette of solution-blended binary solutions is conveniently employed in various coating processes, allowing facile development of BCP SC on the targeted surface. Furthermore, full-color SC paintings are realized with their transparent PC inks, facilitating low-power pattern encryption.     

Trigonometric wavelets for Hermite interpolation

The aim of this paper is to investigate a multiresolution analysis of nested subspaces of trigonometric polynomials. The pair of scaling functions which span the sample spaces are fundamental functions for Hermite interpolation on a dyadic partition of nodes on the interval . Two wavelet functions that generate the corresponding orthogonal complementary subspaces are constructed so as to possess the same fundamental interpolatory properties as the scaling functions. Together with the corresponding dual functions, these interpolatory properties of the scaling functions and wavelets are used to formulate the specific decomposition and reconstruction sequences. Consequently, this trigonometric multiresolution analysis allows a completely explicit algorithmic treatment.

     

Heuristic methods for evolutionary computation techniques

Evolutionary computation techniques, which are based on a powerful principle of evolution—survival of the fittest, constitute an interesting category of heuristic search. In other words, evolutionary techniques are stochastic algorithms whose search methods model some natural phenomena: genetic inheritance and Darwinian strife for survival.Any evolutionary algorithm applied to a particular problem must address the issue of genetic representation of solutions to the problem and genetic operators that would alter the genetic composition of offspring during the reproduction process. However, additional heuristics should be incorporated in the algorithm as well; some of these heuristic rules provide guidelines for evaluating (feasible and infeasible) individuals in the population. This paper surveys such heuristics and discusses their merits and drawbacks.An abridged version of this paper appears in the volume entitled META-HEURISTICS: Theory & Application, edited by Ibrahim H. Osman and James P. Kelly, to be published by Kluwer Academic Publishers in March 1996.     

Higher order spectral estimation for random fields

This paper is concerned with the nonparametric estimation of the higher order cumulant spectra of vector-valued stationary random fields onZ ^d by smoothing the periodograms, whereZ is the space of integers and the dimensiond1. We derive the asymptotic cumulant properties of the spectral estimates, and consider an application to multidimensional nonlinear systems identification. Numerical examples with simulated data are provided.     

Nonmonotone bundle-type scheme for convex nonsmooth minimization

In this paper, we present a general scheme for bundle-type algorithms which includes a nonmonotone line search procedure and for which global convergence can be proved. Some numerical examples are reported, showing that the nonmonotonicity can be beneficial from a computational point of view.This work was partially supported by the National Research Program on Metodi di ottimizzazione per le decisioni, Ministero dell' Universitá e della Ricerca Scientifica e Tecnologica and by ASI: Agenzia Spaziale Italiana.     

The application of the genetic algorithm to the minimization of potential energy functions

We adapted the genetic algorithm to minimize the AMBER potential energy function. We describe specific recombination and mutation operators for this task. Next we use our algorithm to locate low energy conformation of three polypeptides (AGAGAGAGA, A9, and [Met]-enkephalin) which are probably the global minimum conformations. Our potential energy minima are –94.71, –98.50, and –48.94 kcal/mol respectively. Next, we applied our algorithm to the 46 amino acid protein crambin and located a non-native conformation which had an AMBER potential energy 150 kcal/mol lower than the native conformation. This is not necessarily the global minimum conformation, but it does illustrate problems with the AMBER potential energy function. We believe this occurred because the AMBER potential energy function does not account for hydration.     

新型尾式硫代苯并噻唑基卟啉化合物的合成与表征

通过不对称的单羟基卟啉化合物、溴代烷烃和巯基苯并噻唑合成了一系列新型硫代苯并噻唑基尾式卟啉化合物, 并采用核磁共振氢谱、碳谱、红外光谱、质谱和元素分析对卟啉化合物的结构进行了表征.     

Computer interactive identification system for polycyclic aromatic hydrocarbons in reversed-phase microcolumn liquid chromatography

Summary A computer interactive identification system is proposed which is based on the relationship between retention and molecular properties such as the size and shape of polycyclic aromatic hydrocarbons (PAHs). This system offers an automatic analytical process for liquid chromatography, providing a reliable identification of the separated components. The identification can be further enhanced by the use of multiple detectors such as a multichannel UV detector. The system can be used for optimization procedures, resulting in a highly automatic complex analytical system.     

Analysis of grid file algorithms

Grid file algorithms were suggested in [12] to provide multi-key access to records in a dynamically growing file. We specify here two algorithms and derive the average sizes of the corresponding directories. We provide an asymptotic analysis. The growth of the indexes appears to be non-linear for uniform distributions:O(v ^c ) orO(v ), wherec=1+b^–1, =1+(s-1)/(sb+1),s is the number of attributes being used,v the file size, andb the page capacity of the system. Finally we give corresponding results for biased distributions and compare transient phases.     

傅里叶变换红外光谱和傅里叶变换拉曼光谱法无损鉴别药材的真伪

利用傅里叶变换红外（FT-IR）和近红外傅里叶变换拉曼（NIR FT-aman）光谱法对大黄（西宁大黄）与伪品大黄（华北大黄、山大黄、水根大黄）进行了无损快速的鉴别。结果表明：尽管正品大黄与伪品大黄差别较小，有大部分的化学成分有很大的相同之处，但在红外、拉曼谱图中各自的特征峰较突出，根据谱峰的强度和位置可容易地将它们区别开来。红外和拉曼光谱法相互印证，相互补充，具有快速、准确、操作简单、重复性好、不需对样品进行分离提取，可直接鉴别等特点。