Due to the need for concurrent use of N-acetylcysteine (NAC) and ondansetron in the event of acetaminophen overdose, a Y-site intravenous (IV) apparatus for these drugs would be practical. It is known that nausea and vomiting are common side effects of both acetaminophen overdose and NAC administration. Current standard patient care using NAC involves interruption of IV NAC infusion to give an IV bolus dose of ondansetron, which creates an unnecessary opportunity for healthcare staff errors and patient complications. To evaluate the IV compatibility of NAC and ondansetron, medical grade tubing was connected via a closed-circuit IV pump with separate channels. Doses of NAC were circulated in individual channels based on weight-based dosing protocols (30-kg and 100-kg patient does). Ondansetron (4 mg) was introduced into the flow of NAC using the Y-site. Samples of the circulated solutions were gathered in triplicate at time points of 10, 20, and 30 minutes after combination of ondansetron and NAC. Concentrations of NAC were quantified using a validated high performance liquid chromatography (HPLC) method with ultraviolet (UV) detection. Once the collected samples underwent HPLC-UV analysis, data was produced that showed promise for compatibility between ondansetron and NAC with Y-site infusions. Comparison of NAC concentrations for the channels with and without ondansetron yielded no statistically significant difference between the treatments (p-value of 0.05). From this experiment, we concluded that introduction of ondansetron into the flow of NAC IV would not impact NAC concentration. As mentioned before, this study was conducted using only two doses in vitro, which may be a point for further exploration of a varied number of N-acetylcysteine doses.

Yes / Highly-oriented poly(l-lactic acid) (PLLA) with fibrillar structure and micro-grooves was fabricated through solid hot drawing technology for further improving the mechanical properties and blood biocompatibility of PLLA as blood-contacting medical devices. In order to enhance the melt strength and thus obtain high orientation degree, PLLA was first chain extended with ethylene glycol diglycidyl ether (EGDE). The extending degree as high as 25.79 mol% can be obtained at 0.7 wt% EGDE content. The complex viscosity, storage and viscous modulus for chain extended PLLA were improved resulting from the enhancement of molecular entanglement, and consequently higher draw ratio can be achieved during the subsequent hot stretching. The tensile strength and modulus of PLLA were improved dramatically by stretching. The stress-induced crystallization of PLLA occurred during drawing. The interfacial tension (γs·blood) between PLLA surface and blood decreased by chain extension and molecular orientation, indicating the weakened interaction between bioactive substance in the blood and the surface of PLLA. Modification and orientation could significantly enhance the blood compatibility of PLLA by prolonging clotting time and decreasing hemolysis ratio, protein adsorption and platelet activation. The bionic character of oriented PLLA and its anti-coagulation mechanism were tried to be explored. / This research was supported by National Natural Science Foundation of China (Grant No. 51303109)

Arbuscular mycorrhizal fungi (AMF) are an ancient group of obligate symbionts, colonizing the roots of over 72% of land plants, increasing the uptake of nutrients from the soil, and providing many fitness benefits to their host plants. The multinucleate and coenocytic nature of AMF have interested researchers for decades, leading to many theories of the evolution, and genetic organization of these organisms. Recent findings propose that AMF carry two types of strains, identified based on putative MAT-loci, as either homokaryotic, carrying multiple and genetically similar nuclei, or dikaryotic with co-existing nuclei deriving from two parental strains. In other fungi, hyphal fusions, or anastomosis, between compatible strains results in nuclear transfer, creating heterokaryotic spore progeny. It has been hypothesized that dikaryotic AMF strains arose from the anastomosis between compatible homokaryons harbouring different nucleotypes. The goal of this research is to determine whether anastomosis events, known to occur in other fungi, like homokaryon-homokaryon, homokaryon-dikaryon (Buller phenomenon), and/or dikaryon-dikaryon nuclear exchanges also occur in AMF. To achieve this, the anastomosis frequencies between 15 crosses of homokaryotic and dikaryotic strains of the model AMF species Rhizophagus irregularis were examined using microscopy and droplet digital PCR (ddPCR) to determine if nuclear transfer between strains is possible. Overall, these experiments build on the existing evidence of compatible interactions between strains of R. irregularis.

No description available.

No description available.

No description available.

No description available.

No description available.

The lack of consistent summer pasture supply is a major limitation to livestock production in the mid-Atlantic region. Perennial warm-season grasses might provide a solution if managed for high quality. Experiments were conducted on separate well-established stands of Caucasian bluestem and 'Cave-in-Rock' switchgrass at the Kentland Farm near Blacksburg, VA. Stages of grass maturity at harvest simulating pasture and hay systems were tested. Six interseeded legume species and two grass monoculture checks, one with 56 kg N/ha applied in spring and after each harvest, the other with no N, were imposed as sub-plots. Legume species included alfalfa, red clover, sericea lespedeza, annual lespedeza, Illinois bundleflower, and purple prairieclover. Inter-seeded legumes contributed a significant amount to yield and quality of perennial warm-season grasses in the legume-establishment year. In the year after establishment, grass mixtures with alfalfa, red clover, and, for switchgrass, sericea lespedeza yielded as much forage as N-fertilized grasses. Alfalfa and red clover altered the distribution of yield of the grasses, and may not be as compatible with perennial warm-season grasses as sericea lespedeza in the long-term. Interseeded legumes improved quality considerably in the second year. / Master of Science

Recently, many new types of wireless networks have emerged, such as mobile ad hoc networks (MANETs), cognitive radio networks (CRNs) and large scale wireless sensor networks. To get better performance in these wireless networks, various schemes, e.g., metrics, policies, algorithms, protocols, etc., have been proposed. Among them, optimal schemes that can achieve optimal performance are of great importance. On the theoretical side, they provide important design guidelines and performance benchmarks. On the practical side, they guarantee best communication performance with limited network resources. In this dissertation, we focus on the modeling and optimization of routing in wireless networks, including both broadcast routing, unicast routing, and convergecast routing. We study two aspects of routing: algorithm analysis and Qos analysis. In the algorithmic work, we focus on how to build optimal broadcast trees. We investigate the optimality compatibility between three tree-based broadcast routing algorithms and routing metrics. The Qos work includes three parts. First, we focus on how to optimally repair broken paths to minimize impact of path break in MANETs. We propose a provably optimal cached-based route repair policy for real-time traffic in MANETs. Second, we focus on the impact of secondary user (SU) node placement on SU traffic delay in CRNs. We design SU node placement schemes that can minimize the multi-hop delay in CRNs. Third, we analyze the convergecast delay of a large scale sensor network which coexists with WiFi nodes. We derive a closed form delay formula, which can be used to estimate sensor packet convergecast delay given the distance between a sensor node and the sink node together with other networking setting parameters. The main contributions of this dissertation are summarized as follows: Optimality compatibility study between tree-based broadcast routing algorithms and routing metrics: Broadcast routing is a critical component in the routing design. While there are plenty of routing metrics and broadcast routing schemes in current literature, arbitrary combination of broadcast routing metrics with broadcast tree construction (BTC) algorithms may not result in optimal broadcast trees. In this work, we study the requirement on the combination of routing metrics and BTC algorithms to ensure optimal broadcast tree construction. When a BTC algorithm fails to find the optimal broadcast tree, we define that the BTC algorithm and the metric are not optimality compatible. We show that different BTC algorithms have different requirements on the properties of broadcast routing metrics. The metric properties for BTC algorithms in both undirected network topologies and directed network topologies are developed and proved. They are successfully used to verify the optimality compatibility between broadcast routing metrics and BTC algorithms. Optimal cache-based route repair policy for real-time traffic in mobile ad hoc networks: Real-time applications in ad hoc networks require fast route repair mechanisms to minimize the interruptions to their communications. Cache-based route repair schemes are popular choices since they can quickly resume communications using cached backup paths after a route break. In this work, through thorough theoretical modeling of the cache-based route repair process, we derive a provably optimal cache-based route repair policy. This optimal policy considers both the overhead of the route repair schemes and the promptness of the repair action. The correctness and advantages of our optimal policy are validated by extensive simulations. Optimal secondary user node placement study in cognitive radio networks: Information propagation speed (IPS) in a multi-hop CRN is an important factor that affects the network's delay performance and needs to be considered in network planning. The impact of primary user (PU) activities on IPS makes the problem of analyzing IPS in multi-hop CRNs very challenging and hence unsolved in existing literature. In this work, we fill this technical void. We establish models of IPS in multi-hop CRNs and compute how to maximize IPS in two cases. The first case, named the maximum network IPS, maximizes IPS across a network topology over an infinite plane. The second case, named the maximum flow IPS, maximizes the IPS between a given pair of source and destination nodes separated by a fixed distance. We reveal that both maximum IPSs are determined by the PU activity level and the placement of SU relay nodes. We design optimal relay placement strategies in CRNs to maximize these two IPS under different PU activity levels. The correctness of our analytical results is validated by simulations and numerical experiments. Convergecast delay analysis of large scale sensor networks coexisting with WiFi networks: Due to the increasing popularity of wireless devices, such as WiFi (IEEE 802.11) and ZigBee (IEEE 802.15.4), the ISM bands have become more and more crowded. Since ZigBee is the de facto radio technology of sensor networks, coexistence of WiFi networks and sensor (ZigBee) networks is challenging because of the great heterogeneity between WiFi and ZigBee technologies. In the presence of interference from WiFi and other sensor nodes, the performance of sensor networks is not clearly understood. In this work, we study delay performance of a large scale sensor network which coexists with WiFi networks. Given the distance from the sensor node to the sink node, we are interested in the expected delay of sensor packets to reach the sink node in the presence of both WiFi and sensor interference. We formulate the delay analysis problem as a two priority M/G/1 preemptive repeat identical queueing system, and analyze the delay using queueing theory and probability theory. First, we use a path probabilistic approach to derive the expected delay. Second, we develop a simplified linear approximation model for delay analysis. The correctness of both models is validated by NS2 simulations.Recently, many new types of wireless networks have emerged, such as mobile ad hoc networks (MANETs), cognitive radio networks (CRNs) and large scale wireless sensor networks. To get better performance in these wireless networks, various schemes, e.g., metrics, policies, algorithms, protocols, etc., have been proposed. Among them, optimal schemes that can achieve optimal performance are of great importance. On the theoretical side, they provide important design guidelines and performance benchmarks. On the practical side, they guarantee best communication performance with limited network resources. In this dissertation, we focus on the modeling and optimization of routing in wireless networks, including both broadcast routing, unicast routing, and convergecast routing. We study two aspects of routing: algorithm analysis and Qos analysis. In the algorithmic work, we focus on how to build optimal broadcast trees. We investigate the optimality compatibility between three tree-based broadcast routing algorithms and routing metrics. The Qos work includes three parts. First, we focus on how to optimally repair broken paths to minimize impact of path break in MANETs. We propose a provably optimal cached-based route repair policy for real-time traffic in MANETs. Second, we focus on the impact of secondary user (SU) node placement on SU traffic delay in CRNs. We design SU node placement schemes that can minimize the multi-hop delay in CRNs. Third, we analyze the convergecast delay of a large scale sensor network which coexists with WiFi nodes. We derive a closed form delay formula, which can be used to estimate sensor packet convergecast delay given the distance between a sensor node and the sink node together with other networking setting parameters. The main contributions of this dissertation are summarized as follows: Optimality compatibility study between tree-based broadcast routing algorithms and routing metrics: Broadcast routing is a critical component in the routing design. While there are plenty of routing metrics and broadcast routing schemes in current literature, arbitrary combination of broadcast routing metrics with broadcast tree construction (BTC) algorithms may not result in optimal broadcast trees. In this work, we study the requirement on the combination of routing metrics and BTC algorithms to ensure optimal broadcast tree construction. When a BTC algorithm fails to find the optimal broadcast tree, we define that the BTC algorithm and the metric are not optimality compatible. We show that different BTC algorithms have different requirements on the properties of broadcast routing metrics. The metric properties for BTC algorithms in both undirected network topologies and directed network topologies are developed and proved. They are successfully used to verify the optimality compatibility between broadcast routing metrics and BTC algorithms. Optimal cache-based route repair policy for real-time traffic in mobile ad hoc networks: Real-time applications in ad hoc networks require fast route repair mechanisms to minimize the interruptions to their communications. Cache-based route repair schemes are popular choices since they can quickly resume communications using cached backup paths after a route break. In this work, through thorough theoretical modeling of the cache-based route repair process, we derive a provably optimal cache-based route repair policy. This optimal policy considers both the overhead of the route repair schemes and the promptness of the repair action. The correctness and advantages of our optimal policy are validated by extensive simulations. Optimal secondary user node placement study in cognitive radio networks: Information propagation speed (IPS) in a multi-hop CRN is an important factor that affects the network's delay performance and needs to be considered in network planning. The impact of primary user (PU) activities on IPS makes the problem of analyzing IPS in multi-hop CRNs very challenging and hence unsolved in existing literature. In this work, we fill this technical void. We establish models of IPS in multi-hop CRNs and compute how to maximize IPS in two cases. The first case, named the maximum network IPS, maximizes IPS across a network topology over an infinite plane. The second case, named the maximum flow IPS, maximizes the IPS between a given pair of source and destination nodes separated by a fixed distance. We reveal that both maximum IPSs are determined by the PU activity level and the placement of SU relay nodes. We design optimal relay placement strategies in CRNs to maximize these two IPS under different PU activity levels. The correctness of our analytical results is validated by simulations and numerical experiments. Convergecast delay analysis of large scale sensor networks coexisting with WiFi networks: Due to the increasing popularity of wireless devices, such as WiFi (IEEE 802.11) and ZigBee (IEEE 802.15.4), the ISM bands have become more and more crowded. Since ZigBee is the de facto radio technology of sensor networks, coexistence of WiFi networks and sensor (ZigBee) networks is challenging because of the great heterogeneity between WiFi and ZigBee technologies. In the presence of interference from WiFi and other sensor nodes, the performance of sensor networks is not clearly understood. In this work, we study delay performance of a large scale sensor network which coexists with WiFi networks. Given the distance from the sensor node to the sink node, we are interested in the expected delay of sensor packets to reach the sink node in the presence of both WiFi and sensor interference. We formulate the delay analysis problem as a two priority M/G/1 preemptive repeat identical queueing system, and analyze the delay using queueing theory and probability theory. First, we use a path probabilistic approach to derive the expected delay. Second, we develop a simplified linear approximation model for delay analysis. The correctness of both models is validated by NS2 simulations. / Ph. D.