Solvent Influence on Cellulose 1,4‐β‐Glycosidic Bond Cleavage: A Molecular Dynamics and Metadynamics Study

We explore the influence of two solvents, namely water and the ionic liquid 1‐ethyl‐3‐methylimidazolium acetate (EmimAc), on the conformations of two cellulose models (cellobiose and a chain of 40 glucose units) and the solvent impact on glycosidic bond cleavage by acid hydrolysis by using molecular dynamics and metadynamics simulations. We investigate the rotation around the glycosidic bond and ring puckering, as well as the anomeric effect and hydrogen bonds, in order to gauge the effect on the hydrolysis mechanism. We find that EmimAc eases hydrolysis through stronger solvent–cellulose interactions, which break structural and electronic barriers to hydrolysis. Our results indicate that hydrolysis in cellulose chains should start from the ends and not in the centre of the chain, which is less accessible to solvent.     

The evolution and future of influenza pandemic preparedness

The influenza virus is a global threat to human health causing unpredictable yet recurring pandemics, the last four emerging over the course of a hundred years. As our knowledge of influenza virus evolution, distribution, and transmission has increased, paths to pandemic preparedness have become apparent. In the 1950s, the World Health Organization (WHO) established a global influenza surveillance network that is now composed of institutions in 122 member states. This and other surveillance networks monitor circulating influenza strains in humans and animal reservoirs and are primed to detect influenza strains with pandemic potential. Both the United States Centers for Disease Control and Prevention and the WHO have also developed pandemic risk assessment tools that evaluate specific aspects of emerging influenza strains to develop a systematic process of determining research and funding priorities according to the risk of emergence and potential impact. Here, we review the history of influenza pandemic preparedness and the current state of preparedness, and we propose additional measures for improvement. We also comment on the intersection between the influenza pandemic preparedness network and the current SARS-CoV-2 crisis. We must continually evaluate and revise our risk assessment and pandemic preparedness plans and incorporate new information gathered from research and global crises.Subject terms: Influenza virus, Infectious diseases     

Stability of Semiconductor States with Insulating and Contact Boundary Conditions

We prove the existence of global smooth solutions near a given steady state of the hydrodynamic model of the semiconductors in a bounded domain with physical boundary conditions. The steady state and the doping profile are permitted to be of large variation but the initial velocity must be small. Two cases are considered. In the first one the problem is three-dimensional, the boundary conditions are insulating and the steady state velocity vanishes. In the second one, the problem is one-dimensional, the boundary is of contact type and the steady state velocity does not vanish.     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.     

Characterization of low molecular weight hydrocarbon oligomers by laser desorption/ionization time-of-flight mass spectrometry using a solvent-free sample preparation method.

A new solvent-free sample preparation method using silver trifluoroacetate (AgTFA) was developed for the analysis of low molecular weight paraffins and microcrystalline waxes by laser desorption/ionization time-of-flight mass spectrometry (LDI-TOFMS). Experiments show that spectral quality can be enhanced by dispersing AgTFA directly in liquid paraffins without the use of additional solvents. This preparation mixture is applied directly to the MALDI probe. Solid waxes could be examined by melting prior to analysis. The method also provides sufficiently reproducible spectra that peak area ratios between mono- and bicyclic alkane peaks indicated variations in the cycloalkane content of paraffin samples. Dehydrogenation of hydrocarbons observed during the desorption/ionization process was studied by analysis of alkane standards.     

Absence of shocks in an initially dilute collisionless plasma

The Cauchy Problem for the relativistic Vlasov-Maxwell equations is studied in three space dimensions. It is assumed that the initial data satisfy the required constraints and have compact support. If in addition the data have sufficiently smallC ² norm, then a uniqueC ¹ solution to this system is shown to exist on all of spacetime.Research supported in part by NSF DMS 85-20662 and NSF DMS 84-20957     

Validated Infeasible Interior-Point Predictor–Corrector Methods for Linear Programming

Many problems arising in practical applications lead to linear programming problems. Hence, they are fundamentally tractable. Recent interior-point methods can exploit problem structure to solve such problems very efficiently. Infeasible interior-point predictor–corrector methods using floating-point arithmetic sometimes compute an approximate solution with duality gap less than a given tolerance even when the problem may not have a solution. We present an efficient verification method for solving linear programming problems which computes a guaranteed enclosure of the optimal solution and which verifies the existence of the solution within the computed interval.