On characterizing protein spatial clusters with correlation approaches
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.
This project aims at building a dynamic and scalable framework for Byzantine fault tolerant distributed computation. By organizing nodes of a distributed system in fault-tolerant clusters, we mask Byzantine failures of single nodes and provide an abstracti ...
Cloud computing promises flexibility and high performance for users and high cost-efficiency for operators. Nevertheless, most cloud facilities operate at very low utilization, hurting both cost effectiveness and future scalability. We present Quasar, a cl ...
This paper investigates the role of business models for exploiting digital options within digital clusters (that are clusters where collaboration is IT-dependent). To this aim, this research focuses on digital platforms, a specific IT artifact supporting a ...
The organization of connectivity in neuronal networks is fundamental to understanding the activity and function of neural networks and information processing in the brain. Recent studies show that the neocortex is not only organized in columns and layers b ...
The first tetrameric cation-cation neptunyl(v) cluster, [NpO 2(salen) 4(μ 8-K) 2][K(18C6)Py] 2, has been synthesized in non-aqueous solution from the reaction of [(NpO 2Py 5)(KI 2Py 2)] n with K 2salen and its structure determined in the solid state and in ...
Distributed processing over networks relies on in-network processing and cooperation among neighboring agents. Cooperation is beneficial when all agents share the same objective or belong to the same group. However, if agents belong to different clusters o ...
We describe the all-sky Planck catalogue of clusters and cluster candidates derived from Sunyaev-Zeldovich (SZ) effect detections using the first 15.5 months of Planck satellite observations. The catalogue contains 1227 entries, making it over six times th ...
Clustering algorithms have evolved to handle more and more complex structures. However, measures allowing to qualify the quality of such partitions are rare and only specic to certain algorithms. In this work, we propose a new cluster validity measure (CVM ...
We study the role of network architecture in the formation of synchronous clusters in synaptically coupled networks of bursting neurons. We give a simple combinatorial algorithm that finds the largest synchronous clusters from the network topology. We demo ...
Due to high scaling order of MP2 and CCSD(T) methods, it is either difficult or at times even impossible to treat even moderately sized molecular systems with elaborate basis sets such as aug-cc-pVXZ (X = D, T, Q). In the present work, several structures o ...
