反应注射成型聚氨酯互穿聚合物网络研究——刚性网络对于体系形态及性能的影响

用微型反应注射成型机制备了以聚氨酯(PU)为弹性相的两类同步互穿聚合物网络(SIN),其刚性相分别采用保留仲羟基的乙烯基酯树脂(VERH)以及封闭仲羟基的乙烯基酯树脂(VERA)。用傅里叶变换红外光谱在线跟踪了这类互穿网络的生成过程,发现刚性网络抑制了PU网络中硬段有序结构的形成,两个网络间有一定程度的互穿,而两个网络间的化学键作用进一步削弱氢键强度。自旋—自旋弛豫时间的测定进一步表明网络间存在一定的互穿以及刚性相对于PU硬段结晶的抑制作用。材料的力学性能与其SIN的形态有关。VERA网络对PU表现出明显的增强作用,而由VERH网络形成的SIN则由于体系相分离进程受到严重阻碍而使材料性能恶化。     

SYNTHESIS, STRUCTURE AND PROPERTIES OF INTERPENETRATING SULFONIC ACID RESINS WITH HIGH CAPACITY

Two series of interpenetrating sulfonic acid resins (ISAR), 10×n and n×10, were prepared by means of the wet method, and the physicochemical, thermodynamic and kinetic properties of the ISAR were measured. The results show: 10×n resins exhibit better properties than n×10 ones, mainly in higher apparent degree of crosslinking and larger conformational entropy effect, among which, 10×1 resin exhibits the best thermodynamic and kinetic properties. In the DTA graphs of n×10 resins, there are two T_g and two T_(ox), but in those of 10×n, only one T_g and one T_(ox). This result well supports the conclusion that 10×n resins have much better interpenetrating structural aspects.     

Analysis of RNA sequence structure maps by exhaustive enumeration I. Neutral networks

Summary Global relations between RNA sequences and secondary structures are understood as mappings from sequence space into shape space. These mappings are investigated by exhaustive folding of allGC andAU sequences with chain lengths up to 30. The computed structural data are evaluated through exhaustive enumeration and used as an exact reference for testing analytical results derived from mathematical models and sampling based on statistical methods. Several new concepts of RNA sequence to secondary structure mappings are investigated, among them that ofneutral networks (being sets of sequences folding into the same structure). Exhaustive enumeration allows to test several previously suggested relations: the number of (minimum free energy) secondary structures as a function of the chain length as well as the frequency distribution of structures at constant chain length (commonly resulting in generalized forms ofZipf's law).

---

Analyse der Beziehungen zwischen RNA-Sequenzen und Sekundärstrukturen durch vollständige Faltung, 1. Mitt. Faltung, Neutrale Netzwerke

Zusammenfassung Die globalen Benziehungen zwischen RNA-Sequenzen und Sekundärstrukturen werden als Abbildungen aus einem Raum aller Sequenzen in einen Raum aller Strukturen aufgefaßt. Diese Abbildungen werden durch Falten aller binären Sequenzen desGC-undAU-Alphabets mit Kettenlängen bis zun=30 untersucht. Die berechneten Strukturdaten werden durch vollständiges Abzählen ausgewertet und als eine exakte Referenz zum Überprüfen analytischer Resultate aus mathematischen Modellen sowie zum Testen statistisch erhobener Proben verwendet. Einige neuartige Konzepte zur Beschreibung der Beziehungen zwischen Sequenzen und Strukturen werden eingehend untersucht, unter ihnen der Begriff derneutralen Netzwerke. Ein neutrales Netzwerk besteht aus allen Sequenzen, die eine bestimmte Struktur ausbilden. Vollständiges Abzählen ermöglicht beispielsweise die Bestimmung aller Strukturen minimaler freier Energie in Abhängigkeit von der Kettenlänge ebenso wie die Bestimmung der Häufigkeitsverteilungen der Strukturen bei konstanten Kettenlängen. Die letzteren folgen einer verallgemeinerten FormZipfschen Gesetzes.

     

聚氨酯／聚甲基丙烯酸甲酯互穿聚合物网络的研究

本文对(蓖麻油-聚乙二醇)聚氨酯/聚甲基丙烯酸甲酯(PU/PMMA)互穿聚合物网络(IPN)体系进行了研究.实验结果表明:IPN的力学性能受网络化学构型控制.在PU/PMMA为25/75时,应力-应变曲线出现屈服点,产生类似皮革行为,并在此点抗张强度最高,表现明显的协同效应.动态力学性能及电镜均证明该体系相分离十分严重,通过加入扩链剂及网间交联剂能显著改善两组分相容性,其中网间交联剂效果最好。     

Event-triggered sliding mode control for switched genetic regulatory networks with persistent dwell time

This paper focus on the event-triggered sliding mode controller design for discrete-time switched genetic regulatory networks (GRNs) with persistent dwell time (PDT) switching. Firstly, the observation error dynamics of switched GRNs with PDT is constructed in the light of event-triggered sliding mode control (SMC) scheme. Next, sufficient conditions are derived to ensure the exponential stability of the augmented plant. Moreover, an event-triggered SMC law is synthesized to impel the system trajectories onto the sliding surface in a finite time. Finally, a verification example is provided to illustrate the effectiveness and potential of the proposed method.     

Retrieval and chaos in extremely dilutedQ-Ising neural networks

Using a probabilistic approach, the deterministic and the stochastic parallel dynamics of aQ-Ising neural network are studied at finiteQ and in the limitQ. Exact evolution equations are presented for the first time-step. These formulas constitute recursion relations for the parallel dynamics of the extremely diluted asymmetric versions of these networks. An explicit analysis of the retrieval properties is carried out in terms of the gain parameter, the loading capacity, and the temperature. The results for theQ network are compared with those for theQ=3 andQ=4 models. Possible chaotic microscopic behavior is studied using the time evolution of the distance between two network configurations. For arbitrary finiteQ the retrieval regime is always chaotic. In the limitQ the network exhibits a dynamical transition toward chaos.     

The least element property of center location on tree networks with applications to distance and precedence constrained problems

In the classicalp-center location model on a network there is a set of customers, and the primary objective is to selectp service centers that will minimize the maximum distance of a customer to a closest center. Suppose that thep centers receive their supplies from an existing central depot on the network, e.g. a warehouse. Thus, a secondary objective is to locate the centers that optimize the primary objective as close as possible to the central depot. We consider tree networks and twop-center models. We show that the set of optimal solutions to the primary objective has a semilattice structure with respect to some natural ordering. Using this property we prove that there is ap-center solution to the primary objective that simultaneously minimizes every secondary objective function which is monotone nondecreasing in the distances of thep centers from the existing central depot.Restricting the location models to a rooted path network (real line) we prove that the above results hold for the respective classicalp-median problems as well.     

Rigorous results on the thermodynamics of the dilute Hopfield model

We study the Hopfield model of an autoassociative memory on a random graph onN vertices where the probability of two vertices being joined by a link isp(N). Assuming thatp(N) goes to zero more slowly thanO(1/N), we prove the following results: (1) If the number of stored patternsm(N) is small enough such thatm(N)/Np(N) 0, asN, then the free energy of this model converges, upon proper rescaling, to that of the standard Curie-Weiss model, for almost all choices of the random graph and the random patterns. (2) If in additionm(N) < ln N/ln 2, we prove that there exists, forT< 1, a Gibbs measure associated to each original pattern, whereas for higher temperatures the Gibbs measure is unique. The basic technical result in the proofs is a uniform bound on the difference between the Hamiltonian on a random graph and its mean value.