Finding sparse cuts form an important tool for analyzing/partitioning large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. A well developed framework for working with such large graphs is the streaming model wherein the input is assumed to be on disk, and any algorithm is allowed to make few passes over the input that may be too large to stor...

Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs 〈Γ, α〉 of sets Γ of well-formed formulae and well-formed formulae α. In this paper I show how a generalisation of the infinite cut-rule used by Segerberg and Goldblatt enables the removal of the ...

During the last years, the concept of input congestion and technical ineff-ciency in data envelopment analysis (DEA), have been investigated by manyresearchers. The motivation of this paper is to present models which obtain thedecreased output value due to input congestion and technical ineciency. More-over, we extend the models to estimate input congestion, technical ineciencyand output reduct...

Increasing incidence and substantial morbidity and mortality of respiratory diseases requires the development of new human-specific anti-inflammatory and disease-modifying therapeutics. Therefore, new predictive animal models that closely reflect human lung pathology are needed. In the current study, a tiered acute lipopolysaccharide (LPS)-induced inflammation model was established in marmoset ...

We propose an holographic k-essence and dilaton models of dark energy. The correspondence between the k-essence and dilaton energy densities with the holographic density, allows the reconstruction of the potential and the fields for the k-essence and dilaton models in flat FRW background. For the proposed infrared cut-off the reconstruction was made for the two cases of the constant α: for α < ...

We consider the approximability of k-way Hypergraph Cut problem: the input is an edge-weighted hypergraph G = (V, E) and an integer k and the goal is to remove a min-weight subset of the edges such that the residual graph has at least k connected components. When G is a graph this problem admits a 2(1 − 1/k)-approximation [8], however, there has been no non-trivial approximation ratio for gener...

Abstract. We investigate the self-energy of one electron coupled to a quantized radiation field by extending the ideas developed in [H]. We fix an arbitrary cut-off parameter Λ and recover the α-term of the selfenergy, where α is the coupling parameter representing the fine structure constant. Thereby we develop a method which allows to expand the selfenergy up to any power of α. This implies t...

We propose an holographic quintessence and tachyon models of dark energy. The correspondence between the quintessence and tachyon energy densities with the holographic density, allows the reconstruction of the potentials and the dynamics for the quintessence and tachyon fields, in flat FRW background. The proposed infrared cut-off for the holographic energy density works for two cases of the co...