Intersection (mathématiques)

Science formelle
Mathématiques
Logique mathématique
Théorie des ensembles

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (30)

Some New Results On Differential Inclusions For Differential Forms

Bernard Dacorogna, Olivier Kneuss, Saugata Bandyopadhyay

In this article we study some necessary and sufficient conditions for the existence of solutions in W-0(1,infinity) (Omega; Lambda(k)) of the differential inclusion d omega is an element of E a.e. in Omega where E subset of Lambda(k+1) is a prescribed set. ...

Amer Mathematical Soc2015

Configuration Logics: Modelling Architecture Styles

Joseph Sifakis, Simon Bliudze, Anastasia Mavridou, Eduard Baranov

We study a framework for the specification of architecture styles as families of architectures involving a common set of types of components and coordination mechanisms. The framework combines two logics: 1) interaction logics for the specification of arch ...

Springer Int Publishing Ag2015

Why Do Some Water Utilities Recycle More than Others? A Qualitative Comparative Analysis in New South Wales, Australia

Janet Gordon Hering

Although the recycling of municipal wastewater can play an important role in water supply security and ecosystem protection, the percentage of wastewater recycled is generally low and strikingly variable. Previous research has employed detailed case studie ...

Amer Chemical Soc2015

An Information-Centric Communication Infrastructure for Real-Time State Estimation of Active Distribution Networks

Mario Paolone, Paolo Romano, Marco Pignati, Teklemariam Tsegay Tesfay, Styliani Sarri

The evolution toward emerging active distribution networks (ADNs) can be realized via a real-time state estimation (RTSE) application facilitated by the use of phasor measurement units (PMUs). A critical challenge in deploying PMU-based RTSE applications a ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Design and Strand Tests of a Fusion Cable Composed of Coated Conductor Tapes

Pierluigi Bruzzone, Davide Uglietti, Rainer Wesche

The design of a flat cable suitable for future fusion reactors has been carried out. The cable consists of twisted round strands, which are composed of tapes stacked between copper profiles. According to calculations, the strand twist pitch and the cable t ...

IEEE Institute of Electrical and Electronics Engineers2014

Bilinear Control Systems with Forced Integrable Filtration

Philippe Müllhaupt, Basile Graf

A class of nonlinear systems and a filtration of the corresponding codistributions are presented. The filtration enjoys some strong integrability property which allows an easy computation of a linearizing normal form whenever the algorithm terminates with ...

American Institute of Physics2012

Coloring K-k-free intersection graphs of geometric objects in the plane

János Pach

The intersection graph of a collection C of sets is the graph on the vertex set C, in which C-1 . C-2 is an element of C are joined by an edge if and only if C-1 boolean AND C-2 not equal empty set. Erdos conjectured that the chromatic number of triangle-f ...

2012

Self-Adaptive Attractor-Shaping for Oscillators Networks

Max-Olivier Hongler, Julio Rodriguez, Philippe Blanchard

We consider a network of N coupled limit cycle oscillators, each having a set of control parameters Λ_k, k = 1, . . . , N, that controls the frequency and the geometry of the limit cycle. We implement a self-adaptive mechanism that drives the local systems ...

2011

Minimum d-blockers and d-transversals in graphs

Dominique de Werra

We consider a set V of elements and an optimization problem on V: the search for a maximum (or minimum) cardinality subset of V verifying a given property a"similar to. A d-transversal is a subset of V which intersects any optimum solution in at least d el ...

2011

Tangencies between families of disjoint regions in the plane

János Pach

Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the members of C is at most O(kn), and that this bound cannot be improved. If we only ...

2010

Page 2 sur 2