A unified theory for brittle and ductile shear mode fracture

A unified theory captures both brittle and ductile fracture. The fracture toughness is proportional to the applied stress squared and the length of the crack. For purely brittle solids, this criterion is equivalent to Griffith's theory. In other cases, it provides a theoretical basis for the Irwin-Orowan formula. For purely ductile solids, the theory makes direct contact with the Bilby-Cottrell-Swinden model. The toughness is highest in ductile materials because the shielding dislocations in the plastic zone provide additional resistance to crack growth. This resistance is the force opposing dislocation motion, and the Peach-Koehler force overcomes it. A dislocation-free zone separates the plastic zone from and the tip of the crack. The dislocation-free zone is finite because molecular forces responsible for the cohesion of the surfaces near the crack tip are not negligible. At the point of crack growth, the length of the dislocation-free zone is constant and the shielding dislocations advance in concert. As in Griffith's theory, the crack is in unstable equilibrium. The theory shows that a dimensionless variable controls the elastoplastic behaviour. A relationship for the size of the dislocation-free zone is derived in terms of the macroscopic and microscopic parameters that govern the fracture.     

Functional Binding Surface of a β‐Hairpin VEGF Receptor Targeting Peptide Determined by NMR Spectroscopy in Living Cells

In this study, the functional interaction of HPLW peptide with VEGFR2 (Vascular Endothelial Growth Factor Receptor 2) was determined by using fast ¹⁵N‐edited NMR spectroscopic experiments. To this aim, ¹⁵N uniformly labelled HPLW has been added to Porcine Aortic Endothelial Cells. The acquisition of isotope‐edited NMR spectroscopic experiments, including ¹⁵N relaxation measurements, allowed a precise characterization of the in‐cell HPLW epitope recognized by VEGFR2.     

Synthesis of partially fluorinated poly(arylene ether sulfone) multiblock copolymers bearing perfluorosulfonic functions

Partially fluorinated poly(arylene ether sulfone) multiblock copolymers bearing perfluorosulfonic functions (ps‐PES‐FPES), with ionic exchange capacity (IEC) ranging between 0.9 and 1.5 meq H⁺/g, are synthesized by regioselective bromination of partially fluorinated poly(arylene ether sulfone) multiblock copolymers (PES‐FPES), followed by Ullman coupling reaction with lithium 1,1,2,2‐tetrafluoro‐2‐(1,1,2,2‐tetrafluoro‐2‐iodoethoxy)ethanesulfonate. The PES‐FPES are prepared by aromatic nucleophilic substitution reaction by an original approach, that is, “one pot two reactions synthesis.” The chemical structures of polymers are analyzed by ¹H and ¹⁹F NMR spectroscopy. The resulted ionomers present two distinct glass transitions and α relaxations revealing phase separation between the hydrophilic and the hydrophobic domains. The phase separation is observed at much lower block lengths of ps‐PES‐FPES as compared with the literature. AFM and SANS observations supported the phase separation, the hydrophilic domains are well dispersed but the connectivity to each other depends on the ps‐PES block lengths. The thermomechanical behavior, the water up‐take, and the conductivity of the ps‐PES‐FPES membranes are compared with those of Nafion 117^® and randomly functionalized polysulfone (ps‐PES). Conductivities close or higher to those of Nafion 117^® are obtained. © 2015 Wiley Periodicals, Inc. J. Polym. Sci., Part A: Polym. Chem. 2015 , 53, 1941–1956     

An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines

In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison with a widely used decomposition package.     

Tracing Possible Structural Asymmetry of Silica Gel Used for Precoating Thin-Layer Chromatography Plates

JPC – Journal of Planar Chromatography – Modern TLC - We have previously described unexpected two-dimensionality in the thin-layer chromatographic separation of pairs of enantiomers of...     

An efficient electrophilic N-amination utilizing in situ generated chloramine under phase transfer conditions

An efficient, one-pot, phase transfer N-amination technology was developed. The protocol utilizes chloramine, an inexpensive and safe electrophilic aminating agent potentially viable for commercial manufacturing.     

Network externalities in a dynamic monopoly

We reconsider the role of network externalities in a dynamic spatial monopoly where the firm must invest in order to accumulate capacity, while consumers may have either linear or quadratic preferences. We (1) characterise saddle point equilibria, (2) prove that the extent of market coverage is increasing in the network effect and (3) unlike the existing static literature on the same problem, the monopolist may not make introductory price offers. Then, we briefly deal with the socially optimal solution, showing that, in general, a planner would serve more consumers than a profit-seeking monopolist.      

Normal human dermal fibroblasts: proteomic analysis of cell layer and culture medium.

Proteins present within the cell layer and those released in the cell medium from in vitro cultured normal human dermal fibroblasts were separated and characterized in terms of their isoelectric point and molecular weight, by two-dimensional (2-D) gel electrophoresis. All spots in the synthetic gel were firstly analyzed by the Melanie 3 software and compared with those of breast cancer cells, colorectal epithelial cells, HL60, lymphoma cells, and platelets, already available on-line. From the identification of 144 spots from both the cell layer and the medium, we were able to recognize 89 different proteins, since a certain number of spots represented different isoforms of the same molecule. Identifications were performed by matching with on-line 2-D databases, and by matrix assisted laser-desorption/ionization-time of flight-mass spectrometry (MALDI-TOF-MS), in order to confirm the identification by matching, or to identify new proteins. The procedure we used allows (i) to design a highly reproducible reference map of the proteome of adult human normal fibroblasts in culture, (ii) to evaluate protein species produced in the cell layer as well as those released in the culture medium, and (iii) to compare data from gel matching with those obtained by MS. This work represents an essential step for a better knowledge of mesenchymal cells, given the widespread use of this cell type in both clinical and experimental investigations.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

Arithmetic functions with linear recurrence sequences

We obtain asymptotic formulas for all the moments of certain arithmetic functions with linear recurrence sequences. We also apply our results to obtain asymptotic formulas for some mean values related to average orders of elements in finite fields.