http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Measurement of antibacterial properties of foil‑backed electrospun nanofibers
Mary Ann Wagner‑Graham,Herbert Barndt,Mark Andrew Sunderland 한국의류학회 2019 Fashion and Textiles Vol.6 No.1
Current methodologies for evaluation of antibacterial properties of traditional textiles are not applicable to foil-backed, poorly-absorbent electrospun nanofiber materials, since existing test methods require absorbent fabrics. Since electrospun nanofibers are adhered to the foil backing only by electrostatic interactions, methods used to evaluate antibacterial properties of surfaces cannot be used because these protocols cause the nanofibers to lift from the foil backing. Therefore, a novel method for measurement of the antibacterial properties of electrospun metallic foil-backed nanofiber materials was developed. This method indicated that acetate-based nanofibers manufactured to contain 5 to 30 weight percent of cold-pressed hemp seed oil or full-spectrum hemp extract inhibited the growth of Staphylococcus aureus in a dose-dependent manner, from 85.3% (SEM = 2.2) inhibition to 99.3% (SEM = 0.15) inhibition, respectively. This testing method represents an advanced manufacturing prototype procedure for assessment of antibacterial properties of novel electrospun, metallic foil-backed nanofiber materials.
THE PROBABILISTIC METHOD MEETS GO
Graham Farr 대한수학회 2017 대한수학회지 Vol.54 No.4
Go is an ancient game of great complexity and has a huge following in East Asia. It is also very rich mathematically, and can be played on any graph, although it is usually played on a square lattice. As with any game, one of the most fundamental problems is to determine the number of legal positions, or the probability that a random position is legal. A random Go position is generated using a model previously studied by the author, with each vertex being independently Black, White or Uncoloured with probabilities $q,q,1-2q$ respectively. In this paper we consider the probability of legality for two scenarios. Firstly, for an $N\times N$ square lattice graph, we show that, with $q=cN^{-\alpha}$ and $c$ and $\alpha$ constant, as $N\rightarrow\infty$ the limiting probability of legality is 0, $\exp(-2c^5)$, and 1 according as $\alpha<2/5$, $\alpha=2/5$ and $\alpha>2/5$ respectively. On the way, we investigate the behaviour of the number of captured chains (or chromons). Secondly, for a random graph on $n$ vertices with edge probability $p$ generated according to the classical Gilbert-Erd\H{o}s-R\'enyi model $\mathcal{G}(n;p)$, we classify the main situations according to their asymptotic almost sure legality or illegality. Our results draw on a variety of probabilistic and enumerative methods including linearity of expectation, second moment method, factorial moments, polyomino enumeration, giant components in random graphs, and typicality of random structures. We conclude with suggestions for further work.