Preparation of nanofibre yarns from electrospun nonwoven strips

From ancient to modern time, humans have been trying to use finer fibres to make fibrous products for various purposes and believing that finer fibres have better aesthetic qualities. So far, the commercial fibres have been reduced to microns in diameter, but it seems difficult to further reduce the fibre fineness to submicrons using conventional fibre-making techniques.
Electrospinning is a promising technique to produce continuous fibres with diameters on nanometre scales. This technique involves stretching a polymer fluid under a strong electric field into fine filaments, which are deposited randomly on the electrode collector forming a nonwoven nanofibre mat in most cases. Despite considerable efforts in exploring the applications of electrospun nanofibres in non-fibrous fields [1], very limited work has been conducted on using this material to process mechanically robust nanofibre yarns [2,3].

Should capillary blood glucose measurements be used in population surveys?

Objective
To determine the accuracy and appropriateness of capillary blood glucose testing in population surveys.
Materials and methods
Capillary blood glucose using the Rochec ACCU-CHEK instrument and Advantage 11 Test Strips was compared to a laboratory instrument. Three independent cross-sectional risk factor surveys (n=1432) and baseline individuals from the Greater Green Triangle Diabetes Prevention Project (n=341) provided both fasting plasma and capillary blood glucose measurements. Accuracy of capillary glucoses was assessed using the ISO 15197 standard. The median age of the participants was 71years, ranging from 25 to 84years. There were 799 males and 974 females.
Results
Capillary glucose method had poorer precision at lower concentrations (CV: 9.50%, mean=3.09mmol/L, CV: 4.90%, mean=16.78mmol/L, n=233 replicates). Individual discrepancies were seen across the measuring range (2.8–19.9mmol/L, n=1773). In total, 94.5% of results fell within the minimum acceptable accuracy standards. This was slightly short of the 95% of results required to meet the ISO 15197 standard. The prevalence of diabetes in the study population using glucose 7.0mmol/L was 2.4% (95%CI 1.8–3.3%) according to fasting plasma glucose and 2.8% (2.1–3.8%) according to fasting capillary glucose. The lower WHO-defined cut-off of 6.1mmol/L for capillary blood glucose testing gave a prevalence of 10.7% (9.0–12.5%).
Conclusions
This study of matched capillary and plasma glucose results concludes that while it is appropriate to use fasting capillary glucose levels to determine the prevalence of diabetes in populations, it should not be used to reliably diagnose diabetes in individuals.

The median and its extensions

We review various representations of the median and related aggregation functions. An advantage of the median is that it discards extreme values of the inputs, and hence exhibits a better central tendency than the arithmetic mean. However, the value of the median depends on only one or two central inputs. Our aim is to design median-like aggregation functions whose value depends on several central inputs. Such functions will preserve the stability of the median against extreme values, but will take more inputs into account. A method based on graduation curves is presented.

Aggregation for Atanassov's intuitionistic and interval valued fuzzy sets: the median operator

Atanassov's intuitionistic fuzzy sets (AIFS) and interval valued fuzzy sets (IVFS) are two generalizations of a fuzzy set, which are equivalent mathematically although different semantically. We analyze the median aggregation operator for AIFS and IVFS. Different mathematical theories have lead to different definitions of the median operator. We look at the median from various perspectives: as an instance of the intuitionistic ordered weighted averaging operator, as a Fermat point in a plane, as a minimizer of input disagreement, and as an operation on distributive lattices. We underline several connections between these approaches and summarize essential properties of the median in different representations.

Upgrading arc median shortest path problem for an urban transportation network

In this paper, we propose an algorithm for an upgrading arc median shortest path problem for a transportation network. The problem is to identify a set of nondominated paths that minimizes both upgrading cost and overall travel time of the entire network. These two objectives are realistic for transportation network problems, but of a conflicting and noncompensatory nature. In addition, unlike upgrading cost which is the sum of the arc costs on the path, overall travel time of the entire network cannot be expressed as a sum of arc travel times on the path. The proposed solution approach to the problem is based on heuristic labeling and exhaustive search techniques, in criteria space and solution space, respectively. The first approach labels each node in terms of upgrading cost, and deletes cyclic and infeasible paths in criteria space. The latter calculates the overall travel time of the entire network for each feasible path, deletes dominated paths on the basis of the objective vector and identifies a set of Pareto optimal paths in the solution space. The computational study, using two small-scale transportation networks, has demonstrated that the algorithm proposed herein is able to efficiently identify a set of nondominated median shortest paths, based on two conflicting and noncompensatory objectives.

Solving the median shortest path problem in the planning and design of urban transportation networks using a vector labeling algorithm

This paper proposes an alternative algorithm to solve the median shortest path problem (MSPP) in the planning and design of urban transportation networks. The proposed vector labeling algorithm is based on the labeling of each node in terms of a multiple and conflicting vector of objectives which deletes cyclic, infeasible and extreme-dominated paths in the criteria space imposing cyclic break (CB), path cost constraint (PCC) and access cost parameter (ACP) respectively. The output of the algorithm is a set of Pareto optimal paths (POP) with an objective vector from predetermined origin to destination nodes. Thus, this paper formulates an algorithm to identify a non-inferior solution set of POP based on a non-dominated set of objective vectors that leaves the ultimate decision to decision-makers. A numerical experiment is conducted using an artificial transportation network in order to validate and compare results. Sensitivity analysis has shown that the proposed algorithm is more efficient and advantageous over existing solutions in terms of computing execution time and memory space used.

An algorithm to median shortest path problem (MSPP) in the design of urban transportation networks

This paper proposes an efficient solution algorithm for realistic multi-objective median shortest path problems in the design of urban transportation networks. The proposed problem formulation and solution algorithm to median shortest path problem is based on three realistic objectives via route cost or investment cost, overall travel time of the entire network and total toll revenue. The proposed solution approach to the problem is based on the heuristic labeling and exhaustive search technique in criteria space and solution space of the algorithm respectively. The first labels each node in terms of route cost and deletes cyclic and infeasible paths in criteria space imposing cyclic break and route cost constraint respectively. The latter deletes dominated paths in terms of objectives vector in solution space in order to identify a set of Pareto optimal paths. The approach, thus, proposes a non-inferior solution set of Pareto optimal paths based on non-dominated objective vector and leaves the ultimate decision to decision-makers for purpose specific final decision during applications. A numerical experiment is conducted to test the proposed algorithm using artificial transportation network. Sensitivity analyses have shown that the proposed algorithm is advantageous and efficient over existing algorithms to find a set of Pareto optimal paths to median shortest paths problems.

Reptiles in restored agricultural landscapes: the value of linear strips, patches and habitat condition

Habitat restoration, including revegetation of linear strips and enlargement of remnant patches, may benefit native fauna in highly fragmented landscapes. Such restoration has occurred around the world, even though the relative importance of strips and patches of vegetation remains controversial. Using reptile communities from south-eastern Australia, we assessed the conservation value of revegetation in strips and alongside remnant patches compared with remnant vegetation and cleared roadsides. We also examined the distance that reptiles occurred from remnant patches into linear vegetation. We found that reptile species richness and counts did not substantially differ between revegetated, remnant and cleared habitats, or between linear strip and patch treatments. This may indicate that species sensitive to land clearing have already been lost from the landscape. These results imply that if specialist species have already been lost, we may be unable to measure the effects of agriculture on biodiversity. Furthermore, revegetation with the expectation that fauna will recolonize may be unrealistic and translocations may be necessary. Unexpectedly, we recorded higher species richness and counts of rare reptile species in remnant linear strips as distance from remnant patches increased. Ground-layer attributes were important for increasing reptile species richness and counts and in structuring reptile communities, explaining approximately three times as much variation as remnant shape or vegetation type (remnant, revegetated, cleared). Management agencies should protect and effectively manage remnant linear strips if rarer reptiles are to be retained, paying particular attention to ground-layer attributes. The decision to include ground layers in future revegetation activities will be more important than the shape of restored areas.