Aggregation behavior of amphiphilic D-pi-A molecules bearing recognition group

Aggregation behavior of two amphiphilic D-pi -A molecules bearing barbituric acid as both recogniton group and electron-drawing substituent, 5-(4-dodecyl oxybenzylidene)-(1H, 3H)-2,4,6-pyrimidine trione (PB12) and 5-(4-N,N-didodecyl aminobenzylidene)-(1H,3H)-2,4,6-pyrimidine trione (AB(12)) was studied by UV-visible, fluorescence, and surface voltaic spectroscopies (SPS). The experimental results indicate that PB12 tends to form J-aggregate and AB(12) tends to form H-aggregate under increasing concentration. An intramolecular twisted charge transfer (TICT) emission around 500 nm is observed when J-aggregate is formed between PB12 molecules, and an excimer emission around 600 nm is observed when H-aggregate is formed between AB(12) molecules.

Synthesis, electrical properties and crystal structure of a new radical-ion salt based on pi-extended bis(TTF) and a Keggin heteropolymolybdate

By electrocrystallization of 2,6-[4,5-bis(n-butylsulfanyl)-1,3-dithiol-2-ylidene]-4,8-bis(6-iodo-n-hexyloxy)-1,3,5,7-tetrathia-s-indacene (BHBDTI) and [NBu4](4)[SiMo12O40] in the mixed solvent CHCl2CH2Cl and CH3CN, the new radical-ion salt [C42H60Cl2O2S12](2)[SiMo12O40] was prepared. It was characterized by means of IR and ESR spectroscopy and X-ray diffraction. In the crystal structure, organic radical dications and silicomolybdate anions are alternatively arranged along the a axis to form a 1-D conducting layer. The organic layer consists of two isolated groups of BHBDTI divided by the (011) plane without short interatomic contacts. However, in each group, BHBDTI molecules associate with each other in a head to tail manner running along the [011] direction and face-to-face overlapping with a relative shift by approximately one TTF subunit along the long axis of the molecule and a slight shift along the short axis of the molecule with significantly short S ... S contacts. The room-temperature d.c. conductivity determined by the two-probe method is 10(-4) S cm(-1), suggesting that the compound is a semiconductor.

Miscibility and crystallization behavior of solution-blended PEEK/PI blends

Miscibility and crystallization behavior of solution-blended poly(ether ether ketone)/polyimide (PEEK/PI) blends were investigated by using DSC, optical microscopy and SAXS methods. Two kinds of PIs, YS-30 and PEI-E, which consist of the same diamine but different dianhydrides, were used in this work. The experimental results show that blends of PEEK/YS-30 are miscible over the entire composition range, as all the blends of different compositions exhibit a single glass transition temperature. The crystallization of PEEK was hindered by YS-30 in PEEK/YS-30 blends, of which the dominant morphology is interlamellar. On the other hand, blends of PEEK/PEI-E are immiscible, and the effect of PEI-E on the crystallization behavior of PEEK is weak. The crystallinity of PEEK in the isothermally crystallized PEEK/YS-30 blend specimens decreases with the increase in PI content. But the crystallinity of PEEK in the annealed samples almost keeps unchanged and reaches its maximum value, which is more than 50%. The spherulitic texture of the blends depends on both the blend composition and the molecular structure of the PIs used. The more PI added, the more imperfect the crystalline structure of PEEK. (C) 1998 John Wiley & Sons, Inc.

SPES-C与PI共混材料膜的气体除湿性能

以浓硫酸为磺化试剂对聚芳醚砜（ＰＥＳ－Ｃ）进行了磺化改性，得到一系列磺化度不同的产物。采用磺化聚芳醚砜（ＳＰＥＳ－Ｃ）与可溶性聚酰亚胺（ＰＩ）的共混材料制备中空纤维用于空气除湿，研究了磺化度及不同的操作条件对膜除湿性能的影响。结果表明，磺化度适当的ＳＰＥＳ－Ｃ与ＰＩ共混体系不但具有良好的成膜性能，而且膜对水蒸汽具有很高的脱除能力，在操作压力较低（０．２５ＭＰａ）的情况下除湿率可达９５％以上。同时，提高回扫比和操作压力在一定范围内也可以改善这类膜的除湿性能。

SYNTHESIS AND X-RAY CRYSTAL-STRUCTURE OF [EU(ETA-6-C6ME6)(ALCL4)2]4 - THE 1ST CYCLOTETRAMERIC LANTHANIDE(II) COMPLEX WITH A NEUTRAL PI-LIGAND

The reaction of EuCl3, AlCl3 and C6Me6 in toluene gives the Eu(II) complex [Eu(eta-6-C6Me6)(AlCl4)2]4; X-ray crystal determination shows the molecule to be a cyclotetramer, in which the four Eu(C6Me6)AlCl4 units are connected via four groups of eta-2-AlCl4.

THE ALGEBRAIC-METHOD ESTIMATING +/-PI/2 TYPE OF PHASES OF STRUCTURE FACTORS

The algebraic formulas of 1.5 and 2.5 rank which can be applied to estimating +/- pi/2 type of phases for P2(1)2(1)2(1) space group were derived using the method of structure factor algebra. Both types of the formulas are satisfactory for two known crystal structures in estimating their +/- pi/2 type of phases.

CARPS: A Program which Solves Calculus Word Problems

A program was written to solve calculus word problems. The program, CARPS (CALculus Rate Problem Solver), is restricted to rate problems. The overall plan of the program is similar to Bobrow's STUDENT, the primary difference being the introduction of "structures" as the internal model in CARPS. Structures are stored internally as trees. Each structure is designed to hold the information gathered about one object. A description of CARPS is given by working through two problems, one in great detail. Also included is a critical analysis of STUDENT.

Quantum Stratonovich Stochastic Calculus and the Quantum Wong-Zakai Theorem

Gough, John, 'Quantum Stratonovich Stochastic Calculus and the Quantum Wong-Zakai Theorem', Journal of Mathematical Physics. 47, 113509, (2006)

W oczekiwaniu na Paruzję. Myśl eschatologiczna w prawosławnym piśmiennictwie słowiańskim do początku XVI wieku

Wydział Filologii Polskiej i Klasycznej: Instytut Filologii Słowiańskiej

Nie tylko Dzierżon: wprowadzenie do bibliografii piśmiennictwa pszczelniczego na Śląsku

Zadaniem artykułu jest ukazanie dorobku piśmiennictwa pszczelniczego na Śląsku. Pretekstem do poruszenia tego tematu jest przypadająca w 2011 roku dwusetna rocznica urodzin wybitnego pszczelarza Jana Dzierżona. Osoba i dokonania najsłynniejszego chyba w świecie Ślązaka do tego stopnia zdominowały historię pszczelarstwa tego regionu, że właściwie bardzo niewiele mówi się o dorobku innych działających aktywnie śląskich pszczelarzach praktykach i publicystach. Tymczasem dorobek ten jest imponujący. W części pierwszej artykułu przypomniano Nickela Jacoba ze Szprotawy, autora pierwszej wydanej na Śląsku książki pszczelarskiej, uznanego jednocześnie za ojca niemieckiej bibliografii pszczelarskiej. Wśród pionierów niemieckiej literatury fachowej dotyczącej pszczół znajduje się też Johann Coler ze Złotoryi. W XVIII wieku swą działalność praktyczną i publicystyczną w znacznej mierze związali ze Śląskiem Łużyczanin Adam Gottlieb Schirach i Niemiec Johann Riem. W dziełach innych autorów z zakresu gospodarstwa wiejskiego pojawiają się również fragmenty poświęcone pszczelarstwu. Dorobek swych poprzedników wzbogacił i swą działalnością rozsławił śląskie pszczelarstwo ksiądz dr Jan Dzierżon, odkrywca partenogenezy, konstruktor nowoczesnego ula, autor licznych publikacji. „Księciu pszczół” poświęcona została druga część artykułu. Przedstawiono w niej pokrótce jego życie i działalność, dzieje walki o uznanie teorii partenogenezy, ogromny dorobek publicystyczny. Wskazano jednocześnie na brak opracowania pełnej bibliografii podmiotowej. Dzierżon był wydawcą jednego z pierwszych na Śląsku czasopism pszczelarskich. Dorobek śląskiego czasopiśmiennictwa pszczelarskiego jest bogaty i dziwi fakt, że właściwie w bardzo małym dotychczas stopniu został poznany. Część trzecią poświęcono niemieckim i polskim czasopismom pszczelarskim wydawanym na Śląsku. Uwzględniono tutaj tytuły samoistne oraz dodatki. W podsumowaniu wykazano, że we wszystkich obszarach bibliografia piśmiennictwa śląskiego wymaga kompleksowego rozpoznania. Stan opracowania piśmiennictwa pszczelarskiego na Śląsku stanowi w pewnej mierze odbicie stanu bibliografii tego zagadnienia na ziemiach polskich.

Typability and Type Checking in the Second-Order Λ-Calculus Are Equivalent and Undecidable (Preliminary Draft)

We consider the problems of typability[1] and type checking[2] in the Girard/Reynolds second-order polymorphic typed λ-calculus, for which we use the short name "System F" and which we use in the "Curry style" where types are assigned to pure λ -terms. These problems have been considered and proven to be decidable or undecidable for various restrictions and extensions of System F and other related systems, and lower-bound complexity results for System F have been achieved, but they have remained "embarrassing open problems"[3] for System F itself. We first prove that type checking in System F is undecidable by a reduction from semi-unification. We then prove typability in System F is undecidable by a reduction from type checking. Since the reverse reduction is already known, this implies the two problems are equivalent. The second reduction uses a novel method of constructing λ-terms such that in all type derivations, specific bound variables must always be assigned a specific type. Using this technique, we can require that specific subterms must be typable using a specific, fixed type assignment in order for the entire term to be typable at all. Any desired type assignment may be simulated. We develop this method, which we call "constants for free", for both the λK and λI calculi.

A Direct Algorithm for the Type Interference in the Rank 2 Fragment of the Second--Order λ-Calculus

We study the problem of type inference for a family of polymorphic type disciplines containing the power of Core-ML. This family comprises all levels of the stratification of the second-order lambda-calculus by "rank" of types. We show that typability is an undecidable problem at every rank k ≥ 3 of this stratification. While it was already known that typability is decidable at rank ≤ 2, no direct and easy-to-implement algorithm was available. To design such an algorithm, we develop a new notion of reduction and show how to use it to reduce the problem of typability at rank 2 to the problem of acyclic semi-unification. A by-product of our analysis is the publication of a simple solution procedure for acyclic semi-unification.

A Linearization of the Lambda-Calculus and Consequences

If every lambda-abstraction in a lambda-term M binds at most one variable occurrence, then M is said to be "linear". Many questions about linear lambda-terms are relatively easy to answer, e.g. they all are beta-strongly normalizing and all are simply-typable. We extend the syntax of the standard lambda-calculus L to a non-standard lambda-calculus L^ satisfying a linearity condition generalizing the notion in the standard case. Specifically, in L^ a subterm Q of a term M can be applied to several subterms R1,...,Rk in parallel, which we write as (Q. R1 \wedge ... \wedge Rk). The appropriate notion of beta-reduction beta^ for the calculus L^ is such that, if Q is the lambda-abstraction (\lambda x.P) with m\geq 0 bound occurrences of x, the reduction can be carried out provided k = max(m,1). Every M in L^ is thus beta^-SN. We relate standard beta-reduction and non-standard beta^-reduction in several different ways, and draw several consequences, e.g. a new simple proof for the fact that a standard term M is beta-SN iff M can be assigned a so-called "intersection" type ("top" type disallowed).