Approximate Hermitian-Yang-Mills structures and semistability for Higgs bundles. II: Higgs sheaves and admissible structures

We study the basic properties of Higgs sheaves over compact K\"ahler manifolds and we establish some results concerning the notion of semistability; in particular, we show that any extension of semistable Higgs sheaves with equal slopes is semistable. Then, we use the flattening theorem to construct a regularization of any torsion-free Higgs sheaf and we show that it is in fact a Higgs bundle. Using this, we prove that any Hermitian metric on a regularization of a torsion-free Higgs sheaf induces an admissible structure on the Higgs sheaf. Finally, using admissible structures we proved some properties of semistable Higgs sheaves.Comment: 18 pages; some typos correcte

Provenance analysis for instagram photos

As a feasible device fingerprint, sensor pattern noise (SPN) has been proven to be effective in the provenance analysis of digital images. However, with the rise of social media, millions of images are being uploaded to and shared through social media sites every day. An image downloaded from social networks may have gone through a series of unknown image manipulations. Consequently, the trustworthiness of SPN has been challenged in the provenance analysis of the images downloaded from social media platforms. In this paper, we intend to investigate the effects of the pre-defined Instagram images filters on the SPN-based image provenance analysis. We identify two groups of filters that affect the SPN in quite different ways, with Group I consisting of the filters that severely attenuate the SPN and Group II consisting of the filters that well preserve the SPN in the images. We further propose a CNN-based classifier to perform filter-oriented image categorization, aiming to exclude the images manipulated by the filters in Group I and thus improve the reliability of the SPN-based provenance analysis. The results on about 20, 000 images and 18 filters are very promising, with an accuracy higher than 96% in differentiating the filters in Group I and Group II

Pseudo-Automorphisms of positive entropy on the blowups of products of projective spaces

We use a concise method to construct pseudo-automorphisms f_n of the first dynamical degree d_1(f_n) > 1 on the blowups of the projective n-space for all n > 1 and more generally on the blowups of products of projective spaces. These f_n, for n = 3 have positive entropy, and for n > 3 seem to be the first examples of pseudo-automorphisms with d_1(f_n) > 1 (and of non-product type) on rational varieties of higher dimensions.Comment: Mathematische Annalen (to appear

b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs

A b-coloring of a graph is a proper coloring such that every color class contains a vertex that is adjacent to all other color classes. The b-chromatic number of a graph G, denoted by \chi_b(G), is the maximum number t such that G admits a b-coloring with t colors. A graph G is called b-continuous if it admits a b-coloring with t colors, for every t = \chi(G),\ldots,\chi_b(G), and b-monotonic if \chi_b(H_1) \geq \chi_b(H_2) for every induced subgraph H_1 of G, and every induced subgraph H_2 of H_1. We investigate the b-chromatic number of graphs with stability number two. These are exactly the complements of triangle-free graphs, thus including all complements of bipartite graphs. The main results of this work are the following: - We characterize the b-colorings of a graph with stability number two in terms of matchings with no augmenting paths of length one or three. We derive that graphs with stability number two are b-continuous and b-monotonic. - We prove that it is NP-complete to decide whether the b-chromatic number of co-bipartite graph is at most a given threshold. - We describe a polynomial time dynamic programming algorithm to compute the b-chromatic number of co-trees. - Extending several previous results, we show that there is a polynomial time dynamic programming algorithm for computing the b-chromatic number of tree-cographs. Moreover, we show that tree-cographs are b-continuous and b-monotonic

mmSIM: an open toolbox for accessible structured illumination microscopy

Since the first practical super-resolution structured illumination fluorescence microscopes (SIM) were demonstrated more than two decades ago, the method has become increasingly popular for a wide range of bioimaging applications. The high cost and relative inflexibility of commercial systems, coupled with the conceptual simplicity of the approach and the desire to exploit and customize existing hardware, have led to the development of a large number of home-built systems. Several detailed hardware designs are available in the scientific literature, complemented by open-source software tools for SIM image validation and reconstruction. However, there remains a lack of simple open-source software to control these systems and manage the synchronization between hardware components, which is critical for effective SIM imaging. This article describes a new suite of software tools based on the popular Micro-Manager package, which enable the keen microscopist to develop and run a SIM system. We use the software to control two custom-built, high-speed, spatial light modulator-based SIM systems, evaluating their performance by imaging a range of fluorescent samples. By simplifying the process of SIM hardware development, we aim to support wider adoption of the technique. This article is part of the Theo Murphy meeting issue 'Super-resolution structured illumination microscopy (part 1)'

Plastic anisotropy of soft reconstituted clays

The aim of the paper is to extend the experimental validation of the S-CLAY1 model, which is a recently proposed elastoplastic constitutive model that accounts for initial and plastic strain-induced anisotropy. Drained stress path controlled tests were performed on reconstituted samples of four Finnish clays to study the effects of anisotropy in the absence of the complexities of structure present in natural undisturbed clays. Each test involved several loading, unloading, and reloading stages with different values of stress ratio and, hence, induced noticeable changes in the fabric anisotropy. Comparisons between test results and model predictions with the S-CLAY1 model and the modified Cam clay model demonstrate that despite its simplicity, the S-CLAY1 model can provide excellent predictions of the behaviour of unstructured soil

Gender discrimination in the veterinary profession: A brief report of the BVA Employers’ Study 2018

This is the author accepted manuscript. The final version is available from the BVA via the link in this recordDo women in the veterinary profession still face discrimination? Yes – and ironically, it’s those who think women don’t face discrimination that are most likely to discriminate.British Veterniary Associatio

Elastin is Localised to the Interfascicular Matrix of Energy Storing Tendons and Becomes Increasingly Disorganised With Ageing

Tendon is composed of fascicles bound together by the interfascicular matrix (IFM). Energy storing tendons are more elastic and extensible than positional tendons; behaviour provided by specialisation of the IFM to enable repeated interfascicular sliding and recoil. With ageing, the IFM becomes stiffer and less fatigue resistant, potentially explaining why older tendons become more injury-prone. Recent data indicates enrichment of elastin within the IFM, but this has yet to be quantified. We hypothesised that elastin is more prevalent in energy storing than positional tendons, and is mainly localised to the IFM. Further, we hypothesised that elastin becomes disorganised and fragmented, and decreases in amount with ageing, especially in energy storing tendons. Biochemical analyses and immunohistochemical techniques were used to determine elastin content and organisation, in young and old equine energy storing and positional tendons. Supporting the hypothesis, elastin localises to the IFM of energy storing tendons, reducing in quantity and becoming more disorganised with ageing. These changes may contribute to the increased injury risk in aged energy storing tendons. Full understanding of the processes leading to loss of elastin and its disorganisation with ageing may aid in the development of treatments to prevent age related tendinopathy

A Relational Event Approach to Modeling Behavioral Dynamics

This chapter provides an introduction to the analysis of relational event data (i.e., actions, interactions, or other events involving multiple actors that occur over time) within the R/statnet platform. We begin by reviewing the basics of relational event modeling, with an emphasis on models with piecewise constant hazards. We then discuss estimation for dyadic and more general relational event models using the relevent package, with an emphasis on hands-on applications of the methods and interpretation of results. Statnet is a collection of packages for the R statistical computing system that supports the representation, manipulation, visualization, modeling, simulation, and analysis of relational data. Statnet packages are contributed by a team of volunteer developers, and are made freely available under the GNU Public License. These packages are written for the R statistical computing environment, and can be used with any computing platform that supports R (including Windows, Linux, and Mac).

Learning activation functions from data using cubic spline interpolation

Neural networks require a careful design in order to perform properly on a given task. In particular, selecting a good activation function (possibly in a data-dependent fashion) is a crucial step, which remains an open problem in the research community. Despite a large amount of investigations, most current implementations simply select one fixed function from a small set of candidates, which is not adapted during training, and is shared among all neurons throughout the different layers. However, neither two of these assumptions can be supposed optimal in practice. In this paper, we present a principled way to have data-dependent adaptation of the activation functions, which is performed independently for each neuron. This is achieved by leveraging over past and present advances on cubic spline interpolation, allowing for local adaptation of the functions around their regions of use. The resulting algorithm is relatively cheap to implement, and overfitting is counterbalanced by the inclusion of a novel damping criterion, which penalizes unwanted oscillations from a predefined shape. Experimental results validate the proposal over two well-known benchmarks.Comment: Submitted to the 27th Italian Workshop on Neural Networks (WIRN 2017