Given alginate's contribution to Pseudomonas aeruginosa virulence, it has long been considered a promising target for interventional therapies, which have been performed by using the enzyme alginate lyase. In this work, instead of treating pre‐established mucoid biofilms, alginate lyase is immobilized onto a surface as a preventive measure against P. aeruginosa adhesion. A polydopamine dip‐coating strategy is employed for functionalization of polycarbonate surfaces. Enzyme immobilization is confirmed by surface characterization. Surfaces functionalized with alginate lyase exhibit anti‐adhesive properties, inhibiting the attachment of the mucoid strain. Moreover, surfaces modified with this enzyme also inhibit the adhesion of the tested non‐mucoid strain. Unexpectedly, treatment with heat‐inactivated enzyme also inhibits the attachment of mucoid and non‐mucoid P. aeruginosa strains. These findings suggest that the antibacterial performance of alginate lyase functional coatings is catalysis‐independent, highlighting the importance of further studies to better understand its mechanism of action against P. aeruginosa strains.
We develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin [7] holds for all but finitely many graphs. We also use our method to prove special cases of a conjecture of Kahn [13]. In addition, we show that our method is particularly useful for computing the number of independent sets of small sizes in general regular graphs and Moore graphs, and we argue that it can be used in many other cases when dealing with graphs that have numerous structural restrictions. 相似文献
Let G be a graph on n vertices, with maximal degree d, and not containing as an induced subgraph. We prove:
1.
2.
Here is the maximal eigenvalue of the Laplacian of G, is the independence complex of G, and denotes the topological connectivity of a complex plus 2. These results provide improved bounds for the existence of independent transversals in ‐free graphs. 相似文献
A method that use kernel independent component analysis (KICA) and support vector regression (SVR) was proposed for estimation of source ultraviolet (UV) spectra profiles and simultaneous determination of polycomponents in mixtures. In KICA-SVR procedure, the UV source spectra profiles were estimated using KICA, then the mixing matrix of the components were calculated using the estimated sources, and the calibration model was build using SVR based on the calculated mixing matrix. A simulated UV dataset of three-component mixtures was used to test the ability of KICA for estimating source spectra profiles from spectra data of mixtures. It was found that KICA has the potential power to estimate pure UV spectra profiles, and correlation coefficient of estimated sources correspond to the real adopted ones are better compared with that by FastICA and Infomax ICA. An UV dataset of polycomponent vitamin B was processed using the proposed KICA-SVR method. The results show that the estimated source spectra profiles are correlative with the real UV spectra of the components and chemically interpretable, and accurate results were obtained. 相似文献
Opium samples from four different locations and poppy straw from different plant varieties have been assayed using micellar capillary electrophoresis incorporating a sweeping technique. Individual alkaloids (morphine, codeine, papaverine, noscapine, thebaine, oripavine, reticuline and narceine) were quantitatively determined in the different samples by a validated capillary electrophoresis method. Unsupervised pattern recognition of the opium samples and the poppy straw samples using hierarchical cluster analysis (HCA) and principal component analysis (PCA), showed distinct clusters. Supervised pattern recognition using soft independent modelling of class analogy (SIMCA) was performed to show individual groupings and allow unknown samples to be classified according to the models built using the CZE assay results. 相似文献
We show that planar embeddable -connected Laman graphs are generically non-soluble. A Laman graph represents a configuration of points on the Euclidean plane with just enough distance specifications between them to ensure rigidity. Formally, a Laman graph is a maximally independent graph, that is, one that satisfies the vertex-edge count together with a corresponding inequality for each subgraph. The following main theorem of the paper resolves a conjecture of Owen (1991) in the planar case. Let be a maximally independent -connected planar graph, with more than 3 vertices, together with a realisable assignment of generic distances for the edges which includes a normalised unit length (base) edge. Then, for any solution configuration for these distances on a plane, with the base edge vertices placed at rational points, not all coordinates of the vertices lie in a radical extension of the distance field.
