Electrospinning of poly(ethylene-co-vinyl alcohol) nanofibres encapsulated with Ag nanoparticles for skin wound healing

Copyright © 2011 Chao Xu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Skin wound healing is an urgent problem in clinics and military activities. Although significant advances have been made in its treatment, there are several challenges associated with traditional methods, for example, limited donor skin tissue for transplantation and inflammation during long-term healing time. To address these challenges, in this study we present a method to fabricate Poly(ethylene-co-vinyl alcohol) (EVOH) nanofibres encapsulated with Ag nanoparticle using electrospinning technique. The fibres were fabricated with controlled diameters (59nm-3m) by regulating three main parameters, that is, EVOH solution concentration, the electric voltage, and the distance between the injection needle tip (high-voltage point) and the fibre collector. Ag was added to the nanofibres to offer long-term anti-inflammation effect by slow release of Ag nanoparticles through gradual degradation of EVOH nanofibre. The method developed here could lead to new dressing materials for treatment of skin wounds. © 2011 Chao Xu et al.The work was partially supported by the National Natural Science Foundation of China (nos. 10825210, 10872157, and 31050110125) and the National 111 Project of China (no. B06024)

Blind channel identification based on second-order statistics: a frequency-domain approach

In this communication, necessary and sufficient conditions are presented for the unique blind identification of possibly nonminimum phase channels driven by cyclostationary processes. Using a frequency domain formulation, it is first shown that a channel can be identified by the second-order statistics of the observation if and only if the channel transfer function does not have special uniformly spaced zeros. This condition leads to several necessary and sufficient conditions on the observation spectra and the channel impulse response. Based on the frequency-domain formulation, a new identification algorithm is proposed

Paid Peering, Settlement-Free Peering, or Both?

With the rapid growth of congestion-sensitive and data-intensive applications, traditional settlement-free peering agreements with best-effort delivery often do not meet the QoS requirements of content providers (CPs). Meanwhile, Internet access providers (IAPs) feel that revenues from end-users are not sufficient to recoup the upgrade costs of network infrastructures. Consequently, some IAPs have begun to offer CPs a new type of peering agreement, called paid peering, under which they provide CPs with better data delivery quality for a fee. In this paper, we model a network platform where an IAP makes decisions on the peering types offered to CPs and the prices charged to CPs and end-users. We study the optimal peering schemes for the IAP, i.e., to offer CPs both the paid and settlement-free peering to choose from or only one of them, as the objective is profit or welfare maximization. Our results show that 1) the IAP should always offer the paid and settlement-free peering under the profit-optimal and welfare-optimal schemes, respectively, 2) whether to simultaneously offer the other peering type is largely driven by the type of data traffic, e.g., text or video, and 3) regulators might want to encourage the IAP to allocate more network capacity to the settlement-free peering for increasing user welfare

On Optimal Service Differentiation in Congested Network Markets

As Internet applications have become more diverse in recent years, users having heavy demand for online video services are more willing to pay higher prices for better services than light users that mainly use e-mails and instant messages. This encourages the Internet Service Providers (ISPs) to explore service differentiations so as to optimize their profits and allocation of network resources. Much prior work has focused on the viability of network service differentiation by comparing with the case of a single-class service. However, the optimal service differentiation for an ISP subject to resource constraints has remained unsolved. In this work, we establish an optimal control framework to derive the analytical solution to an ISP's optimal service differentiation, i.e. the optimal service qualities and associated prices. By analyzing the structures of the solution, we reveal how an ISP should adjust the service qualities and prices in order to meet varying capacity constraints and users' characteristics. We also obtain the conditions under which ISPs have strong incentives to implement service differentiation and whether regulators should encourage such practices

Sampling Online Social Networks via Heterogeneous Statistics

Most sampling techniques for online social networks (OSNs) are based on a particular sampling method on a single graph, which is referred to as a statistics. However, various realizing methods on different graphs could possibly be used in the same OSN, and they may lead to different sampling efficiencies, i.e., asymptotic variances. To utilize multiple statistics for accurate measurements, we formulate a mixture sampling problem, through which we construct a mixture unbiased estimator which minimizes asymptotic variance. Given fixed sampling budgets for different statistics, we derive the optimal weights to combine the individual estimators; given fixed total budget, we show that a greedy allocation towards the most efficient statistics is optimal. In practice, the sampling efficiencies of statistics can be quite different for various targets and are unknown before sampling. To solve this problem, we design a two-stage framework which adaptively spends a partial budget to test different statistics and allocates the remaining budget to the inferred best statistics. We show that our two-stage framework is a generalization of 1) randomly choosing a statistics and 2) evenly allocating the total budget among all available statistics, and our adaptive algorithm achieves higher efficiency than these benchmark strategies in theory and experiment

The characteristic cycles and semi-canonical bases on type A quiver variety

In this article we study a conjecture of Geiss-Leclerc-Schröer, which is an analogue of a classical conjecture of Lusztig in the Weyl group case. It concerns the relation between canonical basis and semi-canonical basis through the characteristic cycles. We formulate an approach to this conjecture and prove it for type A_2 quiver. In the general type A case, we reduce the conjecture to show that certain nearby cycles have vanishing Euler characteristic