Concept

High-availability cluster

Publications associées (69)

Decentralized clustering for node-variant graph filtering with graph diffusion LMS

In this work, we consider the problem of estimating the coefficients of linear shift-invariant FIR graph filters. We assume hybrid node-varying graph filters where the network is decomposed into clusters of nodes and, within each cluster, all nodes have th ...

IEEE2018

Micro-flock patterns and macro-clusters in chiral active Brownian disks

Chiral active particles (or self-propelled circle swimmers) feature a rich collective behavior, comprising rotating macro-clusters and micro-flock patterns which consist of phase-synchronized rotating clusters with a characteristic self-limited size. These ...

2018

Water soluble derivatives of platinum carbonyl Chini clusters: synthesis, molecular structures and cytotoxicity of [Pt-12(CO)(20)(PTA)(4)](2-) and [Pt-15(CO)(25)(PTA)(5)](2-)

Paul Joseph Dyson, Lucinda Kate Batchelor, Silvia Ruggieri

The reactions of Pt-3n(CO)(6n) (n = 2-5) homoleptic Chini-type clusters with increasing amounts of 1,3,5-triaza-7-phosphaadamantane (PTA) result in the stepwise substitution of one terminal CO ligand per Pt-3 triangular unit up to the formation of [P ...

2018

Diffusion gradient boosting for networked learning

Ali H. Sayed, Bicheng Ying

Using duality arguments from optimization theory, this work develops an effective distributed gradient boosting strategy for inference and classification by networked clusters of learners. By sharing local dual variables with their immediate neighbors thro ...

2017

The mouse genome displays highly dynamic populations of KRAB-zinc finger protein genes and related genetic units

Didier Trono, Julien Léonard Duc, Marco Cassano, Michaël Imbeault, Gabriela Ecco, Annamaria Kauzlaric

KRAB-containing poly-zinc finger proteins (KZFPs) constitute the largest family of transcription factors encoded by mammalian genomes, and growing evidence indicates that they fulfill functions critical to both embryonic development and maintenance of adul ...

Public Library of Science2017

Evolving Takagi-Sugeno model based on online Gustafson-Kessel algorithm and kernel recursive least square method

Soroosh Shafieezadeh Abadeh

In this paper, we introduce an evolving system utilizing sparse weighted kernel least square as local models and online Gustafson-Kessel clustering algorithm for structure identification. Our proposed online clustering algorithm forms elliptical clusters w ...

2016

Job-aware Scheduling in Eagle: Divide and Stick to Your Probes

Willy Zwaenepoel, Pamela Isabel Delgado Borda, Diego Didona, Florin Dinu

We present Eagle, a new hybrid data center scheduler for data-parallel programs. Eagle dynamically divides the nodes of the data center in partitions for the execution of long and short jobs, thereby avoiding head-of-line blocking. Furthermore, it provides ...

ACM2016

Network clustering for voltage control in active distribution network including energy storage systems

Mario Paolone, Mostafa Nick, Maryam Bahramipanah

This paper presents a network partitioning strategy for the optimal voltage control of Active Distribution Networks (ADNs) by means of Dispersed Energy Storage Systems (DESSs). The proposed partitioning is based on the concept of voltage sensitivity coeffi ...

IEEE2015

Fast Distributed Correlation Discovery Over Streaming Time-Series Data

Karl Aberer, Saket Sathe, Tian Guo

The dramatic rise of time-series data in a variety of contexts, such as social networks, mobile sensing, data centre monitoring, etc., has fuelled interest in obtaining real-time insights from such data using distributed stream processing systems. One such ...

2015

MASS-CONCENTRATION RELATION OF CLUSTERS OF GALAXIES FROM CFHTLenS

Jean-Paul Richard Kneib, Huanyuan Shan

Based on weak lensing data from the Canada-France-Hawaii Telescope Lensing Survey (CFHTLenS), in this paper we study the mass-concentration (M-c) relation for similar to 200 redMaPPer clusters in the fields. We extract the M-c relation by measuring the den ...

Iop Publishing Ltd2015

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search