Coassembly in binary mixtures of peptide amphiphiles containing oppositely charged residues

The self-assembly in water of designed peptide amphiphile (PA) C16-ETTES containing two anionic residues and its mixtures with C16-KTTKS containing two cationic residues has been investigated. Multiple spectroscopy, microscopy, and scattering techniques are used to examine ordering extending from the β-sheet structures up to the fibrillar aggregate structure. The peptide amphiphiles both comprise a hexadecyl alkyl chain and a charged pentapeptide headgroup containing two charged residues. For C16-ETTES, the critical aggregation concentration was determined by fluorescence experiments. FTIR and CD spectroscopy were used to examine β-sheet formation. TEM revealed highly extended tape nanostructures with some striped regions corresponding to bilayer structures viewed edge-on. Small-angle X-ray scattering showed a main 5.3 nm bilayer spacing along with a 3 nm spacing. These spacings are assigned respectively to predominant hydrated bilayers and a fraction of dehydrated bilayers. Signs of cooperative self-assembly are observed in the mixtures, including reduced bundling of peptide amphiphile aggregates (extended tape structures) and enhanced β-sheet formation.

Solution-free sets for sums of binary forms

In this paper, we obtain quantitative estimates for the asymptotic density of subsets of the integer lattice Z2 that contain only trivial solutions to an additive equation involving binary forms. In the process we develop an analogue of Vinogradov’s mean value theorem applicable to binary forms.

Analytical and numerical solutions describing the inward solidification of a binary melt

We present a mathematical model describing the inward solidification of a slab, a circular cylinder and a sphere of binary melt kept below its equilibrium freezing temperature. The thermal and physical properties of the melt and solid are assumed to be identical. An asymptotic method, valid in the limit of large Stefan number is used to decompose the moving boundary problem for a pure substance into a hierarchy of fixed-domain diffusion problems. Approximate, analytical solutions are derived for the inward solidification of a slab and a sphere of a binary melt which are compared with numerical solutions of the unapproximated system. The solutions are found to agree within the appropriate asymptotic regime of large Stefan number and small time. Numerical solutions are used to demonstrate the dependence of the solidification process upon the level of impurity and other parameters. We conclude with a discussion of the solutions obtained, their stability and possible extensions and refinements of our study.

Problems with binary pattern measures for flood model evaluation

As the calibration and evaluation of flood inundation models are a prerequisite for their successful application, there is a clear need to ensure that the performance measures that quantify how well models match the available observations are fit for purpose. This paper evaluates the binary pattern performance measures that are frequently used to compare flood inundation models with observations of flood extent. This evaluation considers whether these measures are able to calibrate and evaluate model predictions in a credible and consistent way, i.e. identifying the underlying model behaviour for a number of different purposes such as comparing models of floods of different magnitudes or on different catchments. Through theoretical examples, it is shown that the binary pattern measures are not consistent for floods of different sizes, such that for the same vertical error in water level, a model of a flood of large magnitude appears to perform better than a model of a smaller magnitude flood. Further, the commonly used Critical Success Index (usually referred to as F<2 >) is biased in favour of overprediction of the flood extent, and is also biased towards correctly predicting areas of the domain with smaller topographic gradients. Consequently, it is recommended that future studies consider carefully the implications of reporting conclusions using these performance measures. Additionally, future research should consider whether a more robust and consistent analysis could be achieved by using elevation comparison methods instead.

Regularization of descriptor systems

Implicit dynamic-algebraic equations, known in control theory as descriptor systems, arise naturally in many applications. Such systems may not be regular (often referred to as singular). In that case the equations may not have unique solutions for consistent initial conditions and arbitrary inputs and the system may not be controllable or observable. Many control systems can be regularized by proportional and/or derivative feedback.We present an overview of mathematical theory and numerical techniques for regularizing descriptor systems using feedback controls. The aim is to provide stable numerical techniques for analyzing and constructing regular control and state estimation systems and for ensuring that these systems are robust. State and output feedback designs for regularizing linear time-invariant systems are described, including methods for disturbance decoupling and mixed output problems. Extensions of these techniques to time-varying linear and nonlinear systems are discussed in the final section.

Sample size considerations in active-control non-inferiority trials with binary data based on the odds ratio

This paper presents an approximate closed form sample size formula for determining non-inferiority in active-control trials with binary data. We use the odds-ratio as the measure of the relative treatment effect, derive the sample size formula based on the score test and compare it with a second, well-known formula based on the Wald test. Both closed form formulae are compared with simulations based on the likelihood ratio test. Within the range of parameter values investigated, the score test closed form formula is reasonably accurate when non-inferiority margins are based on odds-ratios of about 0.5 or above and when the magnitude of the odds ratio under the alternative hypothesis lies between about 1 and 2.5. The accuracy generally decreases as the odds ratio under the alternative hypothesis moves upwards from 1. As the non-inferiority margin odds ratio decreases from 0.5, the score test closed form formula increasingly overestimates the sample size irrespective of the magnitude of the odds ratio under the alternative hypothesis. The Wald test closed form formula is also reasonably accurate in the cases where the score test closed form formula works well. Outside these scenarios, the Wald test closed form formula can either underestimate or overestimate the sample size, depending on the magnitude of the non-inferiority margin odds ratio and the odds ratio under the alternative hypothesis. Although neither approximation is accurate for all cases, both approaches lead to satisfactory sample size calculation for non-inferiority trials with binary data where the odds ratio is the parameter of interest.

Precession and nutation in the eta Carinae binary system: evidence from the X-ray light curve

It is believed that eta Carinae is actually a massive binary system, with the wind-wind interaction responsible for the strong X-ray emission. Although the overall shape of the X-ray light curve can be explained by the high eccentricity of the binary orbit, other features like the asymmetry near periastron passage and the short quasi-periodic oscillations seen at those epochs have not yet been accounted for. In this paper we explain these features assuming that the rotation axis of eta Carinae is not perpendicular to the orbital plane of the binary system. As a consequence, the companion star will face eta Carinae on the orbital plane at different latitudes for different orbital phases and, since both the mass-loss rate and the wind velocity are latitude dependent, they would produce the observed asymmetries in the X-ray flux. We were able to reproduce the main features of the X-ray light curve assuming that the rotation axis of eta Carinae forms an angle of 29 degrees +/- 4 degrees with the axis of the binary orbit. We also explained the short quasi-periodic oscillations by assuming nutation of the rotation axis, with an amplitude of about 5 degrees and a period of about 22 days. The nutation parameters, as well as the precession of the apsis, with a period of about 274 years, are consistent with what is expected from the torques induced by the companion star.

Building binary-tree-based multiclass classifiers using separability measures

Various popular machine learning techniques, like support vector machines, are originally conceived for the solution of two-class (binary) classification problems. However, a large number of real problems present more than two classes. A common approach to generalize binary learning techniques to solve problems with more than two classes, also known as multiclass classification problems, consists of hierarchically decomposing the multiclass problem into multiple binary sub-problems, whose outputs are combined to define the predicted class. This strategy results in a tree of binary classifiers, where each internal node corresponds to a binary classifier distinguishing two groups of classes and the leaf nodes correspond to the problem classes. This paper investigates how measures of the separability between classes can be employed in the construction of binary-tree-based multiclass classifiers, adapting the decompositions performed to each particular multiclass problem. (C) 2010 Elsevier B.V. All rights reserved.

A review on the combination of binary classifiers in multiclass problems

Several real problems involve the classification of data into categories or classes. Given a data set containing data whose classes are known, Machine Learning algorithms can be employed for the induction of a classifier able to predict the class of new data from the same domain, performing the desired discrimination. Some learning techniques are originally conceived for the solution of problems with only two classes, also named binary classification problems. However, many problems require the discrimination of examples into more than two categories or classes. This paper presents a survey on the main strategies for the generalization of binary classifiers to problems with more than two classes, known as multiclass classification problems. The focus is on strategies that decompose the original multiclass problem into multiple binary subtasks, whose outputs are combined to obtain the final prediction.