One-pot ligation strategy for atypical ubiquitin chains synthesis by using the trifluoroacetamidomethyl-protected isopeptide-linked Ub (Tfacm-isoUb) unit

Protein chemical synthesis can provide the homogeneous atypical ubiquitin chains that are usually difficult to obtain by other methods. Herein, we report a new one-pot ligation approach for the synthesis of atypical Ub chains based on the Tfacm-protected isoUb building block with operational simplicity and high efficiency. The key intermediate, the Tfacm-protected isoUb building block can be readily prepared by Fmoc SPPS. The practicality and efficiency of the new method is demonstrated by the successful preparation of K11-linked di-Ub.     

Designing and Characterization of Biodegradable Multiblock Poly(L-Lactic Acid)/Polybutadiene Elastomers

A series of poly(L-lactic acid)/polybutadiene (PLA/PB) biodegradable multiblock elastomers was synthesized and characterized. A two-step process to prepare PLA/PB multiblock elastomers was applied. Melt polymerization was used to prepare poly(L-lactic acid) (PLA) terminated with hydroxyl groups and, at the same time, hydroxyl-terminated polybutadiene (HTPB) and 1,6-hexamethylene diisocyanate (HDI) were employed to synthesize diisocyanate-terminated polybutadiene (ITPB). Then, PLA and ITPB were reacted with different PLA/PB weight ratios. Consequently, a series of PLA/PB biodegradable poly(ester-urethane)s with crosslinked chains was obtained. Swelling characteristics and crosslink density of the crosslinked elastomer were investigated. DMA was applied to characterize its thermal properties. The measurement of mechanical properties showed that a PLA/PB elastomer with adjustable mechanical properties was synthesized. Micromorphology, hydrophobicity, and degradability of the material were also characterized.     

Binding numbers for fractional ID-k-factor-critical graphs

LetG be a graph,and k≥2 be a positive integer.A graph G is fractional independentset-deletable k-factor-critical(in short,fractional ID-k-factor-critical),if G I has a fractional k-factor for every independent set I of G.The binding number bind(G)of a graph G is defined as bind(G)=min|NG(X)||X|:=X V(G),NG(X)=V(G).In this paper,it is proved that a graph G is fractional ID-k-factor-critical if n≥6k 9 and bind(G)(3k 1)(n 1)kn 2k+2.     

Structural and functional stabilities of artificially designed DNA ultra-thin films grown by silica Assistance

We report the structural and functional stabilities of artificially synthesized DNA ultra-thin films. Fully covered DNA ultra-thin films on a silica substrate were fabricated by the silica-assisted growth method and those samples were then incubated in various chemicals and physical conditions. The DNA ultra-thin films showed high maintainability under those harsh conditions and these results would aid to facilitate the use of artificial DNA ultra-thin films in advanced research areas such as biophotonics and bioelectronics.     

Privacy Quantification Model Based on the Bayes Conditional Risk in Location-Based Services

The widespread use of Location-Based Services(LBSs),which allows untrusted service providers to collect large quantities of information regarding users’locations,has raised serious privacy concerns.In response to these issues,a variety of LBS Privacy Protection Mechanisms(LPPMs)have been recently proposed.However,evaluating these LPPMs remains problematic because of the absence of a generic adversarial model for most existing privacy metrics.In particular,the relationships between these metrics have not been examined in depth under a common adversarial model,leading to a possible selection of the inappropriate metric,which runs the risk of wrongly evaluating LPPMs.In this paper,we address these issues by proposing a privacy quantification model,which is based on Bayes conditional privacy,to specify a general adversarial model.This model employs a general definition of conditional privacy regarding the adversary’s estimation error to compare the different LBS privacy metrics.Moreover,we present a theoretical analysis for specifying how to connect our metric with other popular LBS privacy metrics.We show that our privacy quantification model permits interpretation and comparison of various popular LBS privacy metrics under a common perspective.Our results contribute to a better understanding of how privacy properties can be measured,as well as to the better selection of the most appropriate metric for any given LBS application.     

Average capacity for non-Kolmogorov turbulent slant optical links with beam wander corrected and pointing errors

The effects of beam wander corrected and pointing errors on the average capacity of a non-Kolmogorov turbulent atmosphere communication channel are studied. The gamma–gamma irradiance probability density function model has been considered to include the effects of non-Kolmogorov turbulence. An expression for the average capacity under beam wander corrected, pointing errors and the spectral index of refractive-index fluctuation. Simulation results for effects of circular detection aperture of radius, atmosphere turbulence strength and wavelength on average capacity are presented. Our results show that the average capacity has an oscillation in the case of short propagation distance, but in the case of long propagation distance, it has gradually reduced curves. And the turbulence strength has a strong influence on average capacity. In general, turbulence reduces the average capacity; it can reduce average capacity by increasing of the power law α. We can ignore the little effects of wavelength increases on the average capacity.     

Comment on: “Topology identification and adaptive synchronization of uncertain complex networks with adaptive double scaling functions” [Commun Nonlinear Sci Numer Simul 2011;16:3337-43]

In this comment letter we point out that the main result of the recent paper [Xu Y, Zhou W, Fang J, Sun W. Topology identification and adaptive synchronization of uncertain complex networks with adaptive double scaling functions. Commun Nonlinear Sci Numer Simul 2011;16(18):3337-43] has certain errors. The mistakes are corrected and a correct version is presented in this letter. We further indicate that a sufficient condition has been neglected in a series of articles discussing the same topic of network topology identification; hence we hope this letter can help clarify some unclear concepts about this topic.