PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm

The cluster editing problem is to transform an input graph into a cluster graph by performing a minimum number of edge editing operations. A cluster graph is a graph where each connected component is a clique. An edit operation can be either adding a new edge or removing an existing edge. In this write-up we outline the core techniques used in the exact cluster editing algorithm of the KaPoCE framework (contains also a heuristic solver), submitted to the exact track of the 2021 PACE challenge

PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm

The cluster editing problem is to transform an input graph into a cluster graph by performing a minimum number of edge editing operations. A cluster graph is a graph where each connected component is a clique. An edit operation can be either adding a new edge or removing an existing edge. In this write-up we outline the core techniques used in the heuristic cluster editing algorithm of the Karlsruhe and Potsdam Cluster Editing (KaPoCE) framework, submitted to the heuristic track of the 2021 PACE challenge

PACE solver description: The KaPoCE exact cluster editing algorithm

The cluster editing problem is to transform an input graph into a cluster graph by performing a minimum number of edge editing operations. A cluster graph is a graph where each connected component is a clique. An edit operation can be either adding a new edge or removing an existing edge. In this write-up we outline the core techniques used in the exact cluster editing algorithm of the KaPoCE framework (contains also a heuristic solver), submitted to the exact track of the 2021 PACE challenge

PACE solver description: KaPoCE: A heuristic cluster editing algorithm

The cluster editing problem is to transform an input graph into a cluster graph by performing a minimum number of edge editing operations. A cluster graph is a graph where each connected component is a clique. An edit operation can be either adding a new edge or removing an existing edge. In this write-up we outline the core techniques used in the heuristic cluster editing algorithm of the Karlsruhe and Potsdam Cluster Editing (KaPoCE) framework, submitted to the heuristic track of the 2021 PACE challenge

A Branch-And-Bound Algorithm for Cluster Editing

The cluster editing problem asks to transform a given graph into a disjoint union of cliques by inserting and deleting as few edges as possible. We describe and evaluate an exact branch-and-bound algorithm for cluster editing. For this, we introduce new reduction rules and adapt existing ones. Moreover, we generalize a known packing technique to obtain lower bounds and experimentally show that it contributes significantly to the performance of the solver. Our experiments further evaluate the effectiveness of the different reduction rules and examine the effects of structural properties of the input graph on solver performance. Our solver won the exact track of the 2021 PACE challenge

REESTRUTURANDO O MODELO DE UNIVERSIDADE PÚBLICA BRASILEIRA PARA ATENDER AOS NOVOS DESAFIOS GERENCIAIS

As universidades públicas brasileiras (UPBs) vêm recebendo, por parte da sociedade em geral, críticas quanto ao seu processo de gestão e têm sido pressionadas a mudar sua forma de atuação. Ainda predomina, nessas universidades, o processo de gestão remanescente de um modelo tradicional de universidade pública que prioriza as atividades de ensino e de pesquisa sem que se incentivem a interdisciplinaridade e a indissociabilidade entre ensino, pesquisa e extensão. Além disso, esse modelo sobrevive em uma cultura administrativa lenta e burocratizante, que precisa ser superada. Isso demonstra a necessidade de atualizar a estrutura organizacional das UPBs de maneira a deixá-la mais ágil, flexível, eficiente e proativa. A partir de uma revisão da literatura e da experiência de gestão dos autores, este artigo tem como objetivo propor uma estrutura organizacional para as UPBs que proporcione simplificação burocrática, melhoria na comunicação interna e aumento na transparência administrativa. Com isso, as UPBs poderão responder às demandas sociais com maior qualidade e eficiência, sem perder sua eficácia social. Os resultados demonstram que a adoção do modelo proposto pode contribuir, significativamente, para a melhoria dos principais indicadores de desempenho das universidades

Mode-coupling theory for multiple-time correlation functions of tagged particle densities and dynamical filters designed for glassy systems

The theoretical framework for higher-order correlation functions involving multiple times and multiple points in a classical, many-body system developed by Van Zon and Schofield [Phys. Rev. E 65, 011106 (2002)] is extended here to include tagged particle densities. Such densities have found an intriguing application as proposed measures of dynamical heterogeneities in structural glasses. The theoretical formalism is based upon projection operator techniques which are used to isolate the slow time evolution of dynamical variables by expanding the slowly-evolving component of arbitrary variables in an infinite basis composed of the products of slow variables of the system. The resulting formally exact mode-coupling expressions for multiple-point and multiple-time correlation functions are made tractable by applying the so-called N-ordering method. This theory is used to derive for moderate densities the leading mode coupling expressions for indicators of relaxation type and domain relaxation, which use dynamical filters that lead to multiple-time correlations of a tagged particle density. The mode coupling expressions for higher order correlation functions are also succesfully tested against simulations of a hard sphere fluid at relatively low density.Comment: 15 pages, 2 figure

Microbial diversity gradients in the geothermal mud volcano underlying the hypersaline Urania Basin

Mud volcanoes transport deep fluidized sediment and their microbial communities and thus provide a window into the deep biosphere. However, mud volcanoes are commonly sampled at the surface and not probed at greater depths, with the consequence that their internal geochemistry and microbiology remain hidden from view. Urania Basin, a hypersaline seafloor basin in the Mediterranean, harbors a mud volcano that erupts fluidized mud into the brine. The vertical mud pipe was amenable to shipboard Niskin bottle and multicorer sampling and provided an opportunity to investigate the downward sequence of bacterial and archaeal communities of the Urania Basin brine, fluid mud layers and consolidated subsurface sediments using 16S rRNA gene sequencing. These microbial communities show characteristic, habitat-related trends as they change throughout the sample series, from extremely halophilic bacteria (KB1) and archaea (Halodesulfoarchaeum spp.) in the brine, toward moderately halophilic and thermophilic endospore-forming bacteria and uncultured archaeal lineages in the mud fluid, and finally ending in aromatics-oxidizing bacteria, uncultured spore formers, and heterotrophic subsurface archaea (Thermoplasmatales, Bathyarchaeota, and Lokiarcheota) in the deep subsurface sediment at the bottom of the mud volcano. Since these bacterial and archaeal lineages are mostly anaerobic heterotrophic fermenters, the microbial ecosystem in the brine and fluidized mud functions as a layered fermenter for the degradation of sedimentary biomass and hydrocarbons. By spreading spore-forming, thermophilic Firmicutes during eruptions, the Urania Basin mud volcano likely functions as a source of endospores that occur widely in cold seafloor sediments

Landscape equivalent of the shoving model

It is shown that the shoving model expression for the average relaxation time of viscous liquids follows largely from a classical "landscape" estimation of barrier heights from curvature at energy minima. The activation energy involves both instantaneous bulk and shear moduli, but the bulk modulus contributes less than 8% to the temperature dependence of the activation energy. This reflects the fact that the physics of the two models are closely related.Comment: 4 page

Nanometer Scale Dielectric Fluctuations at the Glass Transition

Using non-contact scanning probe microscopy (SPM) techniques, dielectric properties were studied on 50 nanometer length scales in poly-vinyl-acetate (PVAc) films in the vicinity of the glass transition. Low frequency (1/f) noise observed in the measurements, was shown to arise from thermal fluctuations of the electric polarization. Anomalous variations observed in the noise spectrum provide direct evidence for cooperative nano-regions with heterogeneous kinetics. The cooperative length scale was determined. Heterogeneity was long-lived only well below the glass transition for faster than average processes.Comment: 4 pages, 4 embedded PS figures, RevTeX - To appear in Phys. Rev. Let