Extra-renal locations of the a4 subunit of H+ATPase

Abstract Background Vacuolar-type proton pumps help maintain acid–base homeostasis either within intracellular compartments or at specialised plasma membranes. In mammals they are made up of 13 subunits, which form two functional domains. A number of the subunits have variants that display tissue restricted expression patterns such that in specialised cell types they replace the generic subunits at some sub-cellular locations. The tissue restricted a4 subunit has previously been reported at the plasma membrane in the kidney, inner ear, olfactory epithelium and male reproductive tract. Results In this study novel locations of the a4 subunit were investigated using an Atp6v0a4 knockout mouse line in which a LacZ reporter cassette replaced part of the gene. The presence of a4 in the olfactory epithelium was further investigated and the additional presence of C2 and d2 subunits identified. The a4 subunit was found in the uterus of pregnant animals and a4 was identified along with d2 and C2 in the embryonic visceral yolk sac. In the male reproductive tract a4 was seen in the novel locations of the prostatic alveoli and the ampullary glands as well as the previously reported epididymis and vas deferens. Conclusions The identification of novel locations for the a4 subunit and other tissue-restricted subunits increases the range of unique subunit combinations making up the proton pump. These studies suggest additional roles of the proton pump, indicating a further range of homologue-specific functions for tissue-restricted subunits

Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles

Confirming a conjecture of Gy´arf´as, we prove that, for all natural numbers k and r, the vertices of every r-edge-colored complete k-uniform hypergraph can be partitioned into a bounded number (independent of the size of the hypergraph) of monochromatic tight cycles. We further prove that, for all natural numbers p and r, the vertices of every r-edge-colored complete graph can be partitioned into a bounded number of pth powers of cycles, settling a problem of Elekes, Soukup, Soukup, and Szentmikl´ossy [Discrete Math., 340 (2017), pp. 2053–2069]. In fact we prove a common generalization of both theorems which further extends these results to all host hypergraphs of bounded independence number

Synchronizing Automata on Quasi Eulerian Digraph

In 1964 \v{C}ern\'{y} conjectured that each $n$-state synchronizing automaton posesses a reset word of length at most $(n-1)^2$. From the other side the best known upper bound on the reset length (minimum length of reset words) is cubic in $n$. Thus the main problem here is to prove quadratic (in $n$) upper bounds. Since 1964, this problem has been solved for few special classes of \sa. One of this result is due to Kari \cite{Ka03} for automata with Eulerian digraphs. In this paper we introduce a new approach to prove quadratic upper bounds and explain it in terms of Markov chains and Perron-Frobenius theories. Using this approach we obtain a quadratic upper bound for a generalization of Eulerian automata.Comment: 8 pages, 1 figur

DC Microgrid Modeling and Energy Storage Placement to Enhance System Stability

The work of this thesis represents a joint venture between the University of Wisconsin-Milwaukee and the University of Wisconsin-Madison. A DC microgrid is selected for the efficiency benefits, lack of reactive power in the system, and ease of connecting to an AC grid. The system modeling relies on physical parameters and industry standard methods for the estimation of loads and lines. An example model is created for the University of Wisconsin - Milwaukee\u27s Campus. Due to the high penetration of renewable energy sources in the example model, system stability is a concern. To help mitigate stability issues, analysis is performed to have the ideal placement of energy storage. The analysis relies heavily on the deep properties of the system such as Eigenvalues and system controllability. Energy storage placement is verified and evaluated with model simulations

Mutation testing on an object-oriented framework: An experience report

This is the preprint version of the article - Copyright @ 2011 ElsevierContext The increasing presence of Object-Oriented (OO) programs in industrial systems is progressively drawing the attention of mutation researchers toward this paradigm. However, while the number of research contributions in this topic is plentiful, the number of empirical results is still marginal and mostly provided by researchers rather than practitioners. Objective This article reports our experience using mutation testing to measure the effectiveness of an automated test data generator from a user perspective. Method In our study, we applied both traditional and class-level mutation operators to FaMa, an open source Java framework currently being used for research and commercial purposes. We also compared and contrasted our results with the data obtained from some motivating faults found in the literature and two real tools for the analysis of feature models, FaMa and SPLOT. Results Our results are summarized in a number of lessons learned supporting previous isolated results as well as new findings that hopefully will motivate further research in the field. Conclusion We conclude that mutation testing is an effective and affordable technique to measure the effectiveness of test mechanisms in OO systems. We found, however, several practical limitations in current tool support that should be addressed to facilitate the work of testers. We also missed specific techniques and tools to apply mutation testing at the system level.This work has been partially supported by the European Commission (FEDER) and Spanish Government under CICYT Project SETI (TIN2009-07366) and the Andalusian Government Projects ISABEL (TIC-2533) and THEOS (TIC-5906)

Saturated simplicial complexes

AbstractAmong shellable complexes a certain class has maximal modular homology, and these are the so-called saturated complexes. We extend the notion of saturation to arbitrary pure complexes and give a survey of their properties. It is shown that saturated complexes can be characterized via the p-rank of incidence matrices and via the structure of links. We show that rank-selected subcomplexes of saturated complexes are also saturated, and that order complexes of geometric lattices are saturated

Quantum Weakly Nondeterministic Communication Complexity

We study the weakest model of quantum nondeterminism in which a classical proof has to be checked with probability one by a quantum protocol. We show the first separation between classical nondeterministic communication complexity and this model of quantum nondeterministic communication complexity for a total function. This separation is quadratic.Comment: 12 pages. v3: minor correction