Publications related to Fuzzy set

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

SET processes in Lewis acid–base reactions: the tritylation of N-heterocyclic carbenes

Rosario Scopelliti, Kay Severin, Farzaneh Fadaei Tirani, Andrzej Sienkiewicz, Cristian Pezzato, Zhaowen Dong

Reactions between N-heterocyclic carbenes (NHCs) and the trityl cation, [Ph3C]+, give covalent adducts of type [NHC–CPh3]+ and/or [NHC–C6H5–CPh2]+. EPR spectroscopy, UV-Vis analyses, and trapping experiments imply that adduct formation involves carbene rad ...

2020

EPFL Library Research Data Management Fastguides

Francesco Varrato, Antoine Louis Claude Masson, Eliane Ninfa Blumer, Sitthida Samath, Fantin Reichler, Jérôme Julien Chaptinel

This is a set of 11 1-sheet guides, providing abridged notions, advice and references for quick and practical research data management: #01 Research Data: the basics #02 FAIR Data Principles #03 Cost of Research Data Management #04 File Formats #05 Metadat ...

2019

Cross-sections of line configurations in R-3 and (d-2)-flat configurations in R-d

Andres Jacinto Ruiz Vargas

We consider sets L = {l(1),..., l(n)} of n labeled lines in general position in R-3, and study the order types of point sets {p(1),..., p(n)} that stem from the intersections of the lines in L with (directed) planes Pi, not parallel to any line of L, that ...

ELSEVIER SCIENCE BV2019

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

On the Hardness of the Strongly Dependent Decision Problem

Martin Biely

We present necessary and sufficient conditions for solving the strongly dependent decision (SDD) problem in various distributed systems. Our main contribution is a novel characterization of the SDD problem based on point-set topology. For partially synchro ...

ASSOC COMPUTING MACHINERY2019

Bretherton's buoyant bubble

John Martin Kolinski, Wassim Dhaouadi

When a buoyant bubble is inserted into a closed capillary that is slightly smaller than the capillary length, it appears stuck; exactly why this is so is a puzzle that has remained unanswered over the past 50 years. Recent calculations suggest that the bub ...

2019

Formal Approaches to Querying Big Data in Shared-Nothing Systems

Bas Ketsman

To meet today's data management needs, it is a widespread practice to use distributed data storage and processing systems. Since the publication of the MapReduce paradigm, a plethora of such systems arose, but although widespread, the capabilities of these ...

ASSOC COMPUTING MACHINERY2019

Construction of Polar Codes With Sublinear Complexity

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

Fuzzy set

Graph Chatbot

Chat with Graph Search

SET processes in Lewis acid–base reactions: the tritylation of N-heterocyclic carbenes

EPFL Library Research Data Management Fastguides

Cross-sections of line configurations in R-3 and (d-2)-flat configurations in R-d

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

On the Hardness of the Strongly Dependent Decision Problem

Bretherton's buoyant bubble

A lower bound on opaque sets

Formal Approaches to Querying Big Data in Shared-Nothing Systems

A machine learning approach based on generative topographic mapping for disruption prevention and avoidance at JET

Construction of Polar Codes With Sublinear Complexity

EPFL Library Research Data Management Fastguides

SET processes in Lewis acid–base reactions: the tritylation of N-heterocyclic carbenes

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

On the Hardness of the Strongly Dependent Decision Problem

A machine learning approach based on generative topographic mapping for disruption prevention and avoidance at JET

Cross-sections of line configurations in R-3 and (d-2)-flat configurations in R-d

Bretherton's buoyant bubble

Construction of Polar Codes With Sublinear Complexity

A lower bound on opaque sets

Formal Approaches to Querying Big Data in Shared-Nothing Systems